Walter Vogler

Fundam. Informaticae, 2021

Correction to: A linear-time branching-time perspective on interface automata.

[BibT_eX]

[DOI]

Acta Informatica, 2021

2020

A linear-time branching-time perspective on interface automata.

[BibT_eX]

[DOI]

Acta Informatica, 2020

2019

Modal Open Petri Nets.

[BibT_eX]

[DOI]

Vitali Schneider

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

2018

Fair testing and stubborn sets.

[BibT_eX]

[DOI]

Antti Valmari

Int. J. Softw. Tools Technol. Transf., 2018

Fault-Free Refinements for Interface Automata.

[BibT_eX]

[DOI]

Ayleen Schinko

Sci. Ann. Comput. Sci., 2018

Interface Automata for Shared Memory.

[BibT_eX]

[DOI]

Proceedings of the Models, Mindsets, 2018

2017

Testing Preorders for dMTS: Deadlock- and the New Deadlock-/DivergenceTesting.

[BibT_eX]

[DOI]

Lev Sorokin

ACM Trans. Embed. Comput. Syst., 2017

ACTL for Modal Interface Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Deciding conformance for bounded responsiveness.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2017

2016

Nondeterministic Modal Interfaces.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

Failure Semantics for Modal Transition Systems.

[BibT_eX]

[DOI]

ACM Trans. Embed. Comput. Syst., 2015

Error-pruning in interface automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Richer interface automata with optimistic and pessimistic compatibility.

[BibT_eX]

[DOI]

Sascha Fendrich

Acta Informatica, 2015

Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing.

[BibT_eX]

[DOI]

Lev Sorokin

Proceedings of the 15th International Conference on Application of Concurrency to System Design, 2015

2014

Recent advances in unfolding technique.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Undecidability of accordance for open systems with unbounded message queues.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Trace- and failure-based semantics for responsiveness.

[BibT_eX]

[DOI]

Acta Informatica, 2014

2013

Richer Interface Automata with Optimistic and Pessimistic Compatibility.

[BibT_eX]

[DOI]

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013

Modal Interface Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Trace- and Failure-Based Semantics for Bounded Responsiveness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Service-Oriented and Cloud Computing, 2013

STG-Based Resynthesis for Balsa Circuits.

[BibT_eX]

[DOI]

Stanislavs Golubcovs

Norman Kluge

Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2012

A trace-based service semantics guaranteeing deadlock freedom.

[BibT_eX]

[DOI]

Acta Informatica, 2012

A Trace-Based Semantics for Responsiveness.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011

Safe reasoning with Logic LTS.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Signal transition graph decomposition: internal communication for speed independent circuit implementation.

[BibT_eX]

[DOI]

IET Comput. Digit. Tech., 2011

Preface.

[BibT_eX]

[DOI]

Stephen A. Edwards

Ryszard Janicki

Fundam. Informaticae, 2011

Read Operators and their Expressiveness in Process Algebras

[BibT_eX]

[DOI]

Massimo Callisto De Donato

Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

Automated Analysis of MUTEX Algorithms with FASE

[BibT_eX]

[DOI]

Federico Buti

Massimo Callisto De Donato

Proceedings of Second International Symposium on Games, 2011

Evaluating the Efficiency of Asynchronous Systems with FASE

[BibT_eX]

[DOI]

Federico Buti

CoRR, 2011

A Trace-Based View on Operating Guidelines.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2011

STG Decomposition: Partitioning Heuristics.

[BibT_eX]

[DOI]

Dominic Wist

Ralf Wollowski

Proceedings of the 11th International Conference on Application of Concurrency to System Design, 2011

2010

Ready simulation for concurrency: It's logical!

[BibT_eX]

[DOI]

Inf. Comput., 2010

STG Decomposition: Internal Communication for SI Implementability.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Application of Concurrency to System Design, 2010

2009

Avoiding Irreducible CSC Conflicts by Internal Communication.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Robustness of a bisimulation-type faster-than preorder

[BibT_eX]

[DOI]

Katrin Iltgen

Proceedings of the Proceedings 16th International Workshop on Expressiveness in Concurrency, 2009

STG decomposition strategies in combination with unfolding.

[BibT_eX]

[DOI]

Acta Informatica, 2009

Liveness of a mutex algorithm in a fair process algebra.

[BibT_eX]

[DOI]

Acta Informatica, 2009

Time and Fairness in a Process Algebra with Non-blocking Reading.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2008

Another short proof of optimality for the MIN cache replacement algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Output-Determinacy and Asynchronous Circuit Synthesis.

[BibT_eX]

[DOI]

Victor Khomenko

Mark Schäfer

Fundam. Informaticae, 2008

2007

Component refinement and CSC-solving for STG decomposition.

[BibT_eX]

[DOI]

Mark Schäfer

Theor. Comput. Sci., 2007

Conjunction on processes: Full abstraction via ready-tree semantics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Performance of pipelined asynchronous systems.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2007

Fair testing.

[BibT_eX]

[DOI]

Arend Rensink

Inf. Comput., 2007

Improved Decomposition of Signal Transition Graphs.

[BibT_eX]

[DOI]

Ben Kangsah

Fundam. Informaticae, 2007

2006

Bisimulation on speed: A unified approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Fairness of components in system computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Merged processes: a new condensed representation of Petri net behaviour.

[BibT_eX]

[DOI]

Acta Informatica, 2006

Fairness of Actions in System Computations.

[BibT_eX]

[DOI]

Acta Informatica, 2006

Stronger Reduction Criteria for Local First Search.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2006

Checking a Mutex Algorithm in a Process Algebra with Fairness.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Strategies for Optimised STG Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 2006

2005

Measuring the performance of asynchronous systems with PAFAS.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Bisimulation on speed: Lower time bounds.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

Determinate STG Decomposition of Marked Graphs.

[BibT_eX]

[DOI]

Mark Schäfer

Petr Jancar

Proceedings of the Applications and Theory of Petri Nets 2005, 2005

Improved Decomposition of STGs.

[BibT_eX]

[DOI]

Ben Kangsah

Proceedings of the Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 2005

2004

Bisimulation on speed: worst-case efficiency.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Timed Petri Nets: Efficiency of Asynchronous Systems.

[BibT_eX]

[DOI]

Elmar Bihler

Proceedings of the Formal Methods for the Design of Real-Time Systems, 2004

2003

Faster asynchronous systems.

[BibT_eX]

[DOI]

Inf. Comput., 2003

Canonical prefixes of Petri net unfoldings.

[BibT_eX]

[DOI]

Victor Khomenko

Maciej Koutny

Acta Informatica, 2003

Relating Fairness and Timing in Process Algebras.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2003, 2003

2002

Partial order semantics and read arcs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Efficiency of asynchronous systems, read arcs, and the MUTEX-problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

An Improvement of McMillan's Unfolding Algorithm.

[BibT_eX]

[DOI]

Javier Esparza

Stefan Römer

Formal Methods Syst. Des., 2002

Preface.

[BibT_eX]

[DOI]

Kim Larsen

Proceedings of the International Workshop on Models for Time-Critical Systems, 2002

Comparing the worst-case efficiency of asynchronous systems with PAFAS.

[BibT_eX]

[DOI]

Acta Informatica, 2002

Decomposition in Asynchronous Circuit Design.

[BibT_eX]

[DOI]

Ralf Wollowski

Proceedings of the Concurrency and Hardware Design, Advances in Petri Nets, 2002

2001

Fast asynchronous systems in dense time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Preface.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Models for Time-Critical Systems, 2001

A Faster-than Relation for Asynchronous Processes.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2001, 2001

Partial S-Invariants for the Verification of Infinite Systems Families.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 2001, 2001

PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations.

[BibT_eX]

[DOI]

Proceedings of the 2nd Asia-Pacific Conference on Quality Software (APAQS 2001), 2001

2000

Axiomatizing a Fragment of PAFAS.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Models for Time-Critical Systems, 2000

Efficiency of Asynchronous Systems That Communicate Asynchronously.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 2000, 2000

1999

Comparing the Efficiency of Asynchronous Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Real-Time and Probabilistic Systems, 1999

Concurrent Implementation of Asynchronous Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 1999, 1999

1998

Unfolding and Finite Prefix for Nets with Read Arcs.

[BibT_eX]

[DOI]

Alexei L. Semenov

Alexandre Yakovlev

Proceedings of the CONCUR '98: Concurrency Theory, 1998

Efficiency of Token-Passing MUTEX-Solutions - Some Experiments.

[BibT_eX]

[DOI]

Elmar Bihler

Proceedings of the Application and Theory of Petri Nets 1998, 1998

1997

Efficiency of Asynchronous Systems and Read Arcs in Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

A Short STory on Action Refinement.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996

The Limit of Split<sub>n</sub>-Language Equivalence.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Applications of Fair Testing.

[BibT_eX]

Ed Brinksma

Arend Rensink

Proceedings of the Formal Description Techniques IX: Theory, 1996

1995

Timed Testing of Concurrent Systems

[BibT_eX]

[DOI]

Inf. Comput., September, 1995

Generalized OM-Bisimulation

[BibT_eX]

[DOI]

Inf. Comput., April, 1995

Fairness and Partial Order Semantics.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Partial Order Semantics and Weak Fairness.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

The Limit of Split_n-Language Equivalence.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Fair Testing.

[BibT_eX]

[DOI]

Ed Brinksma

Arend Rensink

Proceedings of the CONCUR '95: Concurrency Theory, 1995

1993

Bisimulation and Action Refinement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

On Hyperedge Replacement and BNLC Graph Grammars.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

1992

Quality criteria for partial order semantics of place/transition-nets with capacities.

[BibT_eX]

Fundam. Informaticae, 1992

Asynchronous Communication of Petri Nets and the Refinement of Transitions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Partial words versus processes: a short comparison.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

Modular Construction and Partial Order Semantics of Petri Nets

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 625, Springer, ISBN: 3-540-55767-9, 1992

1991

Is partial order semantics necessary for action refinement?

[BibT_eX]

[DOI]

Forschungsberichte, TU Munich, 1991

Asynchronous communication of Petri nets and the refinements of transitions

[BibT_eX]

[DOI]

Forschungsberichte, TU Munich, 1991

Executions: A New Partial-Order Semantics of Petri Nets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

A generalization of traces.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1991

Failures Semantics Based on Interval Semiwords is a Congruence for Refinement.

[BibT_eX]

[DOI]

Distributed Comput., 1991

Deciding History Preserving Bisimilarity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

A generalization of trace theory

[BibT_eX]

[DOI]

Forschungsberichte, TU Munich, 1990

Recognizing edge replacement graph languages in cubic time

[BibT_eX]

[DOI]

Forschungsberichte, TU Munich, 1990

Quality criteria for partial order semantics of place/transitions nets

[BibT_eX]

[DOI]

Forschungsberichte, TU Munich, 1990

Failures semantics of Petri nets and the refinement of places and transitions

[BibT_eX]

[DOI]

Forschungsberichte, TU Munich, 1990

Quality Criteria for Partial Order Semantics of Place/Transition-Nets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

On the Synchronization of Traces.

[BibT_eX]

[DOI]

Volker Diekert

Math. Syst. Theory, 1989

Failures Semantics and Deadlocking of Modular Petri Nets.

[BibT_eX]

[DOI]

Acta Informatica, 1989

Step Failures Semantics and a Complete Proof System.

[BibT_eX]

[DOI]

Dirk Taubner

Acta Informatica, 1989

Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages.

[BibT_eX]

[DOI]

Acta Informatica, 1989

Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

A survey of behaviour and equivalence preserving refinements of Petri nets.

[BibT_eX]

[DOI]

Wilfried Brauer

Proceedings of the Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, 1989

1988

Local Checking of Trace Synchroniziability.

[BibT_eX]

[DOI]

Volker Diekert

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Representation of a swapping class by one net.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1989, 1988

1987

Complativle graph properties are decidable for hypergraph replacement graph languages.

[BibT_eX]

Bull. EATCS, 1987

An Improved Multiple Identification Algorithm for Synchronous Broadcasting Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 1987

The Step Failure Semantics.

[BibT_eX]

[DOI]

Dirk Taubner

Proceedings of the STACS 87, 1987

1986

Representing abstract groups by powers of a graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Behaviour Preserving Refinement of Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1985

The square of a connected S(K<sub>1, 3</sub>)-free graph is vertex pancyclic.

[BibT_eX]

[DOI]

George Hendry

J. Graph Theory, 1985

Some remarks on universal graphs.

[BibT_eX]

[DOI]

Reinhard Diestel

Rudolf Halin

Comb., 1985

1984

Graphs with given group and given constant link.

[BibT_eX]

[DOI]