Graphs with given group and given constant link. - Walter Vogler (J. Graph Theory, 1984)

Some remarks on universal graphs. - Reinhard Diestel; Rudolf Halin; Walter Vogler (Comb., 1985)

The square of a connected S(K1, 3)-free graph is vertex pancyclic. - George Hendry; Walter Vogler (J. Graph Theory, 1985)

Behaviour Preserving Refinement of Petri Nets. - Walter Vogler (WG, 1986)

Representing abstract groups by powers of a graph. - Walter Vogler (J. Comb. Theory B, 1986)

The Step Failure Semantics. - Dirk Taubner; Walter Vogler (STACS, 1987)

An Improved Multiple Identification Algorithm for Synchronous Broadcasting Networks. - Walter Vogler (WDAG, 1987)

Complativle graph properties are decidable for hypergraph replacement graph languages. - Annegret Habel; Hans-Jörg Kreowski; Walter Vogler (Bull. EATCS, 1987)

Representation of a swapping class by one net. - Walter Vogler (European Workshop on Applications and Theory in Petri Nets, 1988)

Local Checking of Trace Synchroniziability. - Volker Diekert; Walter Vogler (MFCS, 1988)

A survey of behaviour and equivalence preserving refinements of Petri nets. - Wilfried Brauer; Robert Gold; Walter Vogler (Applications and Theory of Petri Nets, 1989)

Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. - Annegret Habel; Hans-Jörg Kreowski; Walter Vogler (TAPSOFT, Vol.1, 1989)

Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages. - Annegret Habel; Hans-Jörg Kreowski; Walter Vogler (Acta Informatica, 1989)

Step Failures Semantics and a Complete Proof System. - Dirk Taubner; Walter Vogler (Acta Informatica, 1989)

Failures Semantics and Deadlocking of Modular Petri Nets. - Walter Vogler (Acta Informatica, 1989)

On the Synchronization of Traces. - Volker Diekert; Walter Vogler (Math. Syst. Theory, 1989)

Quality Criteria for Partial Order Semantics of Place/Transition-Nets. - Robert Gold; Walter Vogler (MFCS, 1990)

Failures semantics of Petri nets and the refinement of places and transitions - Walter Vogler (Forschungsberichte, TU Munich, 1990)

Quality criteria for partial order semantics of place/transitions nets - Robert Gold; Walter Vogler (Forschungsberichte, TU Munich, 1990)

Recognizing edge replacement graph languages in cubic time - Walter Vogler (Forschungsberichte, TU Munich, 1990)

A generalization of trace theory - Walter Vogler (Forschungsberichte, TU Munich, 1990)

Deciding History Preserving Bisimilarity. - Walter Vogler (ICALP, 1991)

Failures Semantics Based on Interval Semiwords is a Congruence for Refinement. - Walter Vogler (Distributed Comput., 1991)

A generalization of traces. - Walter Vogler (RAIRO Theor. Informatics Appl., 1991)

Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. - Annegret Habel; Hans-Jörg Kreowski; Walter Vogler (Theor. Comput. Sci., 1991)

Executions: A New Partial-Order Semantics of Petri Nets. - Walter Vogler (Theor. Comput. Sci., 1991)

Asynchronous communication of Petri nets and the refinements of transitions - Walter Vogler (Forschungsberichte, TU Munich, 1991)

Is partial order semantics necessary for action refinement? - Walter Vogler (Forschungsberichte, TU Munich, 1991)

Modular Construction and Partial Order Semantics of Petri Nets - Walter Vogler (Springer, 1992)

Partial words versus processes: a short comparison. - Walter Vogler (Advances in Petri Nets: The DEMON Project, 1992)

Asynchronous Communication of Petri Nets and the Refinement of Transitions. - Walter Vogler (ICALP, 1992)

Quality criteria for partial order semantics of place/transition-nets with capacities. - Robert Gold; Walter Vogler (Fundam. Informaticae, 1992)

On Hyperedge Replacement and BNLC Graph Grammars. - Walter Vogler (Discret. Appl. Math., 1993)

Bisimulation and Action Refinement. - Walter Vogler (Theor. Comput. Sci., 1993)

Fair Testing. - Ed Brinksma; Arend Rensink; Walter Vogler (CONCUR, 1995)

The Limit of Split_n-Language Equivalence. - Walter Vogler (ICALP, 1995)

Partial Order Semantics and Weak Fairness. - Walter Vogler (STRICT, 1995)

Fairness and Partial Order Semantics. - Walter Vogler (Inf. Process. Lett., 1995)

Generalized OM-Bisimulation - Walter Vogler (Inf. Comput., 1995)

Timed Testing of Concurrent Systems - Walter Vogler (Inf. Comput., 1995)

Applications of Fair Testing. - Ed Brinksma; Arend Rensink; Walter Vogler (FORTE, 1996)

The Limit of Splitn-Language Equivalence. - Walter Vogler (Inf. Comput., 1996)

A Short STory on Action Refinement. - Walter Vogler (Foundations of Computer Science: Potential - Theory - Cognition, 1997)

Efficiency of Asynchronous Systems and Read Arcs in Petri Nets. - Walter Vogler (ICALP, 1997)

Efficiency of Token-Passing MUTEX-Solutions - Some Experiments. - Elmar Bihler; Walter Vogler (ICATPN, 1998)

Unfolding and Finite Prefix for Nets with Read Arcs. - Walter Vogler; Alexei L. Semenov; Alexandre Yakovlev (CONCUR, 1998)

Concurrent Implementation of Asynchronous Transition Systems. - Walter Vogler (ICATPN, 1999)

Comparing the Efficiency of Asynchronous Systems. - Lars Jenner; Walter Vogler (ARTS, 1999)

Efficiency of Asynchronous Systems That Communicate Asynchronously. - Walter Vogler (ICATPN, 2000)

Axiomatizing a Fragment of PAFAS. - Walter Vogler; Lars Jenner (MTCS, 2000)

PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations. - Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (APAQS, 2001)

Partial S-Invariants for the Verification of Infinite Systems Families. - Walter Vogler (ICATPN, 2001)

A Faster-than Relation for Asynchronous Processes. - Gerald Lüttgen; Walter Vogler (CONCUR, 2001)

Preface. - Flavio Corradini; Walter Vogler (MTCS, 2001)

Fast asynchronous systems in dense time. - Lars Jenner; Walter Vogler (Theor. Comput. Sci., 2001)

Decomposition in Asynchronous Circuit Design. - Walter Vogler; Ralf Wollowski (Concurrency and Hardware Design, 2002)

Comparing the worst-case efficiency of asynchronous systems with PAFAS. - Flavio Corradini; Walter Vogler; Lars Jenner (Acta Informatica, 2002)

Preface. - Walter Vogler; Kim Larsen (MTCS, 2002)

An Improvement of McMillan's Unfolding Algorithm. - Javier Esparza; Stefan Römer; Walter Vogler (Formal Methods Syst. Des., 2002)

Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. - Walter Vogler (Theor. Comput. Sci., 2002)

Partial order semantics and read arcs. - Walter Vogler (Theor. Comput. Sci., 2002)

Relating Fairness and Timing in Process Algebras. - Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (CONCUR, 2003)

Canonical prefixes of Petri net unfoldings. - Victor Khomenko; Maciej Koutny; Walter Vogler (Acta Informatica, 2003)

Faster asynchronous systems. - Walter Vogler (Inf. Comput., 2003)

Timed Petri Nets: Efficiency of Asynchronous Systems. - Elmar Bihler; Walter Vogler (SFM, 2004)

Bisimulation on speed: worst-case efficiency. - Gerald Lüttgen; Walter Vogler (Inf. Comput., 2004)

Improved Decomposition of STGs. - Walter Vogler; Ben Kangsah (ACSD, 2005)

Determinate STG Decomposition of Marked Graphs. - Mark Schäfer; Walter Vogler; Petr Jancar (ICATPN, 2005)

Bisimulation on speed: Lower time bounds. - Gerald Lüttgen; Walter Vogler (RAIRO Theor. Informatics Appl., 2005)

Measuring the performance of asynchronous systems with PAFAS. - Flavio Corradini; Walter Vogler (Theor. Comput. Sci., 2005)

Strategies for Optimised STG Decomposition. - Mark Schäfer; Walter Vogler; Ralf Wollowski; Victor Khomenko (ACSD, 2006)

Checking a Mutex Algorithm in a Process Algebra with Fairness. - Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (CONCUR, 2006)

Stronger Reduction Criteria for Local First Search. - Marcos E. Kurbán; Peter Niebert; Hongyang Qu 001; Walter Vogler (ICTAC, 2006)

Fairness of Actions in System Computations. - Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (Acta Informatica, 2006)

Merged processes: a new condensed representation of Petri net behaviour. - Victor Khomenko; Alex Kondratyev; Maciej Koutny; Walter Vogler (Acta Informatica, 2006)

Fairness of components in system computations. - Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (Theor. Comput. Sci., 2006)

Bisimulation on speed: A unified approach. - Gerald Lüttgen; Walter Vogler (Theor. Comput. Sci., 2006)

Improved Decomposition of Signal Transition Graphs. - Walter Vogler; Ben Kangsah (Fundam. Informaticae, 2007)

Fair testing. - Arend Rensink; Walter Vogler (Inf. Comput., 2007)

Performance of pipelined asynchronous systems. - Flavio Corradini; Walter Vogler (J. Log. Algebraic Methods Program., 2007)

Conjunction on processes: Full abstraction via ready-tree semantics. - Gerald Lüttgen; Walter Vogler (Theor. Comput. Sci., 2007)

Component refinement and CSC-solving for STG decomposition. - Mark Schäfer; Walter Vogler (Theor. Comput. Sci., 2007)

Output-Determinacy and Asynchronous Circuit Synthesis. - Victor Khomenko; Mark Schäfer; Walter Vogler (Fundam. Informaticae, 2008)

Another short proof of optimality for the MIN cache replacement algorithm. - Walter Vogler (Inf. Process. Lett., 2008)

Time and Fairness in a Process Algebra with Non-blocking Reading. - Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (SOFSEM, 2009)

Liveness of a mutex algorithm in a fair process algebra. - Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (Acta Informatica, 2009)

STG decomposition strategies in combination with unfolding. - Victor Khomenko; Mark Schäfer; Walter Vogler; Ralf Wollowski (Acta Informatica, 2009)

Robustness of a bisimulation-type faster-than preorder - Katrin Iltgen; Walter Vogler (EXPRESS, 2009)

Avoiding Irreducible CSC Conflicts by Internal Communication. - Dominic Wist; Ralf Wollowski; Mark Schäfer; Walter Vogler (Fundam. Informaticae, 2009)

STG Decomposition: Internal Communication for SI Implementability. - Dominic Wist; Mark Schäfer; Walter Vogler; Ralf Wollowski (ACSD, 2010)

Ready simulation for concurrency: It's logical! - Gerald Lüttgen; Walter Vogler (Inf. Comput., 2010)

STG Decomposition: Partitioning Heuristics. - Dominic Wist; Walter Vogler; Ralf Wollowski (ACSD, 2011)

A Trace-Based View on Operating Guidelines. - Christian Stahl; Walter Vogler (FoSSaCS, 2011)

Evaluating the Efficiency of Asynchronous Systems with FASE - Federico Buti; Massimo Callisto De Donato; Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (CoRR, 2011)

Automated Analysis of MUTEX Algorithms with FASE - Federico Buti; Massimo Callisto De Donato; Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (GandALF, 2011)

Read Operators and their Expressiveness in Process Algebras - Flavio Corradini; Maria Rita Di Berardini; Walter Vogler (EXPRESS, 2011)

Preface. - Stephen A. Edwards; Ryszard Janicki; Walter Vogler (Fundam. Informaticae, 2011)

Signal transition graph decomposition: internal communication for speed independent circuit implementation. - Dominic Wist; M. Schaefer; Walter Vogler; Ralf Wollowski (IET Comput. Digit. Tech., 2011)

Safe reasoning with Logic LTS. - Gerald Lüttgen; Walter Vogler (Theor. Comput. Sci., 2011)

A Trace-Based Semantics for Responsiveness. - Walter Vogler; Christian Stahl; Richard Müller 001 (ACSD, 2012)

A trace-based service semantics guaranteeing deadlock freedom. - Christian Stahl; Walter Vogler (Acta Informatica, 2012)

STG-Based Resynthesis for Balsa Circuits. - Stanislavs Golubcovs; Walter Vogler; Norman Kluge (ACSD, 2013)

Trace- and Failure-Based Semantics for Bounded Responsiveness. - Walter Vogler; Christian Stahl; Richard Müller 001 (ESOCC Workshops, 2013)

Modal Interface Automata. - Gerald Lüttgen; Walter Vogler (Log. Methods Comput. Sci., 2013)

Richer Interface Automata with Optimistic and Pessimistic Compatibility. - Gerald Lüttgen; Walter Vogler (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013)

Trace- and failure-based semantics for responsiveness. - Walter Vogler; Christian Stahl; Richard Müller 001 (Acta Informatica, 2014)

Undecidability of accordance for open systems with unbounded message queues. - Richard Müller 001; Christian Stahl; Walter Vogler (Inf. Process. Lett., 2014)

Recent advances in unfolding technique. - Blai Bonet; Patrik Haslum; Victor Khomenko; Sylvie Thiébaux; Walter Vogler (Theor. Comput. Sci., 2014)

Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing. - Ferenc Bujtor; Lev Sorokin; Walter Vogler (ACSD, 2015)

Richer interface automata with optimistic and pessimistic compatibility. - Gerald Lüttgen; Walter Vogler; Sascha Fendrich (Acta Informatica, 2015)

Error-pruning in interface automata. - Ferenc Bujtor; Walter Vogler (Theor. Comput. Sci., 2015)

Failure Semantics for Modal Transition Systems. - Ferenc Bujtor; Walter Vogler (ACM Trans. Embed. Comput. Syst., 2015)

Nondeterministic Modal Interfaces. - Ferenc Bujtor; Sascha Fendrich; Gerald Lüttgen; Walter Vogler (Theor. Comput. Sci., 2016)

Deciding conformance for bounded responsiveness. - Richard Müller 001; Christian Stahl; Walter Vogler (Sci. Comput. Program., 2017)

ACTL for Modal Interface Automata. - Ferenc Bujtor; Walter Vogler (Theor. Comput. Sci., 2017)

Testing Preorders for dMTS: Deadlock- and the New Deadlock-/DivergenceTesting. - Ferenc Bujtor; Lev Sorokin; Walter Vogler (ACM Trans. Embed. Comput. Syst., 2017)

Interface Automata for Shared Memory. - Johannes Gareis; Gerald Lüttgen; Ayleen Schinko; Walter Vogler (Models, Mindsets, Meta, 2018)

Fault-Free Refinements for Interface Automata. - Ayleen Schinko; Walter Vogler (Sci. Ann. Comput. Sci., 2018)

Fair testing and stubborn sets. - Antti Valmari; Walter Vogler (Int. J. Softw. Tools Technol. Transf., 2018)

Modal Open Petri Nets. - Vitali Schneider; Walter Vogler (Petri Nets, 2019)

A linear-time branching-time perspective on interface automata. - Walter Vogler; Gerald Lüttgen (Acta Informatica, 2020)

Correction to: A linear-time branching-time perspective on interface automata. - Walter Vogler; Gerald Lüttgen (Acta Informatica, 2021)

Stubborn Sets, Frozen Actions, and Fair Testing. - Antti Valmari; Walter Vogler (Fundam. Informaticae, 2021)

Interface Automata for Shared Memory. - Ayleen Schinko; Walter Vogler; Johannes Gareis; N. Tri Nguyen; Gerald Lüttgen (Acta Informatica, 2022)