Walter Vogler - RankMe

158 papers A* 8A 4B 23C 2Journal 76Unranked 41

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Interface Automata for Shared Memory. Acta Informatica Ayleen Schinko, Walter Vogler, Johannes Gareis, N. Tri Nguyen, Gerald Lüttgen
2021	J	`jnl`	Correction to: A linear-time branching-time perspective on interface automata. Acta Informatica Walter Vogler, Gerald Lüttgen
2021	J	`jnl`	Stubborn Sets, Frozen Actions, and Fair Testing. Fundam. Informaticae Antti Valmari, Walter Vogler
2020	J	`jnl`	A linear-time branching-time perspective on interface automata. Acta Informatica Walter Vogler, Gerald Lüttgen
2019	B	`conf`	Modal Open Petri Nets. Petri Nets Vitali Schneider, Walter Vogler
2018	J	`jnl`	Fair testing and stubborn sets. Int. J. Softw. Tools Technol. Transf. Antti Valmari, Walter Vogler
2018	—	`conf`	Fault-Free Refinements for Interface Automata. ACSD Ayleen Schinko, Walter Vogler
2018	J	`jnl`	Fault-Free Refinements for Interface Automata. Sci. Ann. Comput. Sci. Ayleen Schinko, Walter Vogler
2018	—	`conf`	Interface Automata for Shared Memory. Models, Mindsets, Meta Johannes Gareis, Gerald Lüttgen, Ayleen Schinko, Walter Vogler
2017	J	`jnl`	ACTL for Modal Interface Automata. Theor. Comput. Sci. Ferenc Bujtor, Walter Vogler
2017	J	`jnl`	Deciding conformance for bounded responsiveness. Sci. Comput. Program. Richard Müller, Christian Stahl, Walter Vogler
2017	J	`jnl`	Testing Preorders for dMTS: Deadlock- and the New Deadlock-/DivergenceTesting. ACM Trans. Embed. Comput. Syst. Ferenc Bujtor, Lev Sorokin, Walter Vogler
2016	—	`conf`	ACTL for Modal Interface Automata. ACSD Ferenc Bujtor, Walter Vogler
2016	—	`conf`	Fair Testing and Stubborn Sets. SPIN Antti Valmari, Walter Vogler
2016	J	`jnl`	Nondeterministic Modal Interfaces. Theor. Comput. Sci. Ferenc Bujtor, Sascha Fendrich, Gerald Lüttgen, Walter Vogler
2015	J	`jnl`	Error-pruning in interface automata. Theor. Comput. Sci. Ferenc Bujtor, Walter Vogler
2015	J	`jnl`	Failure Semantics for Modal Transition Systems. ACM Trans. Embed. Comput. Syst. Ferenc Bujtor, Walter Vogler
2015	B	`conf`	Nondeterministic Modal Interfaces. SOFSEM Ferenc Bujtor, Sascha Fendrich, Gerald Lüttgen, Walter Vogler
2015	J	`jnl`	Richer interface automata with optimistic and pessimistic compatibility. Acta Informatica Gerald Lüttgen, Walter Vogler, Sascha Fendrich
2015	—	`conf`	Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing. ACSD Ferenc Bujtor, Lev Sorokin, Walter Vogler
2014	B	`conf`	Error-Pruning in Interface Automata. SOFSEM Ferenc Bujtor, Walter Vogler
2014	—	`conf`	Failure Semantics for Modal Transition Systems. ACSD Ferenc Bujtor, Walter Vogler
2014	J	`jnl`	Recent advances in unfolding technique. Theor. Comput. Sci. Blai Bonet, Patrik Haslum, Victor Khomenko, Sylvie Thiébaux, Walter Vogler
2014	J	`jnl`	Trace- and failure-based semantics for responsiveness. Acta Informatica Walter Vogler, Christian Stahl, Richard Müller
2014	J	`jnl`	Undecidability of accordance for open systems with unbounded message queues. Inf. Process. Lett. Richard Müller, Christian Stahl, Walter Vogler
2013	J	`jnl`	Modal Interface Automata. Log. Methods Comput. Sci. Gerald Lüttgen, Walter Vogler
2013	J	`jnl`	Richer Interface Automata with Optimistic and Pessimistic Compatibility. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Gerald Lüttgen, Walter Vogler
2013	—	`conf`	STG-Based Resynthesis for Balsa Circuits. ACSD Stanislavs Golubcovs, Walter Vogler, Norman Kluge
2013	—	`conf`	Trace- and Failure-Based Semantics for Bounded Responsiveness. ESOCC Workshops Walter Vogler, Christian Stahl, Richard Müller
2012	—	`conf`	A Trace-Based Semantics for Responsiveness. ACSD Walter Vogler, Christian Stahl, Richard Müller
2012	J	`jnl`	A trace-based service semantics guaranteeing deadlock freedom. Acta Informatica Christian Stahl, Walter Vogler
2012	—	`conf`	Modal Interface Automata. IFIP TCS Gerald Lüttgen, Walter Vogler
2011	B	`conf`	A Trace-Based View on Operating Guidelines. FoSSaCS Christian Stahl, Walter Vogler
2011	—	`conf`	Automated Analysis of MUTEX Algorithms with FASE GandALF Federico Buti, Massimo Callisto De Donato, Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2011	J	`jnl`	Evaluating the Efficiency of Asynchronous Systems with FASE CoRR Federico Buti, Massimo Callisto De Donato, Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2011	J	`jnl`	Preface. Fundam. Informaticae Stephen A. Edwards, Ryszard Janicki, Walter Vogler
2011	—	`conf`	Read Operators and their Expressiveness in Process Algebras EXPRESS Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2011	—	`conf`	STG Decomposition: Partitioning Heuristics. ACSD Dominic Wist, Walter Vogler, Ralf Wollowski
2011	J	`jnl`	Safe reasoning with Logic LTS. Theor. Comput. Sci. Gerald Lüttgen, Walter Vogler
2011	J	`jnl`	Signal transition graph decomposition: internal communication for speed independent circuit implementation. IET Comput. Digit. Tech. Dominic Wist, M. Schaefer, Walter Vogler, Ralf Wollowski
2010	J	`jnl`	Ready simulation for concurrency: It's logical! Inf. Comput. Gerald Lüttgen, Walter Vogler
2010	—	`conf`	STG Decomposition: Internal Communication for SI Implementability. ACSD Dominic Wist, Mark Schäfer, Walter Vogler, Ralf Wollowski
2009	J	`jnl`	Avoiding Irreducible CSC Conflicts by Internal Communication. Fundam. Informaticae Dominic Wist, Ralf Wollowski, Mark Schäfer, Walter Vogler
2009	J	`jnl`	Liveness of a mutex algorithm in a fair process algebra. Acta Informatica Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2009	—	`conf`	Robustness of a bisimulation-type faster-than preorder EXPRESS Katrin Iltgen, Walter Vogler
2009	J	`jnl`	STG decomposition strategies in combination with unfolding. Acta Informatica Victor Khomenko, Mark Schäfer, Walter Vogler, Ralf Wollowski
2009	B	`conf`	Safe Reasoning with Logic LTS. SOFSEM Gerald Lüttgen, Walter Vogler
2009	B	`conf`	Time and Fairness in a Process Algebra with Non-blocking Reading. SOFSEM Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2008	J	`jnl`	Another short proof of optimality for the MIN cache replacement algorithm. Inf. Process. Lett. Walter Vogler
2008	—	`conf`	Avoiding irreducible CSC conflicts by internal communication. ACSD Mark Schäfer, Walter Vogler, Dominic Wist, Ralf Wollowski
2008	J	`jnl`	Output-Determinacy and Asynchronous Circuit Synthesis. Fundam. Informaticae Victor Khomenko, Mark Schäfer, Walter Vogler
2007	J	`jnl`	Component refinement and CSC-solving for STG decomposition. Theor. Comput. Sci. Mark Schäfer, Walter Vogler
2007	J	`jnl`	Conjunction on processes: Full abstraction via ready-tree semantics. Theor. Comput. Sci. Gerald Lüttgen, Walter Vogler
2007	J	`jnl`	Fair testing. Inf. Comput. Arend Rensink, Walter Vogler
2007	J	`jnl`	Improved Decomposition of Signal Transition Graphs. Fundam. Informaticae Walter Vogler, Ben Kangsah
2007	—	`conf`	Output-Determinacy and Asynchronous Circuit Synthesis. ACSD Victor Khomenko, Mark Schäfer, Walter Vogler
2007	J	`jnl`	Performance of pipelined asynchronous systems. J. Log. Algebraic Methods Program. Flavio Corradini, Walter Vogler
2007	A*	`conf`	Ready Simulation for Concurrency: It's Logical! ICALP Gerald Lüttgen, Walter Vogler
2006	J	`jnl`	Bisimulation on speed: A unified approach. Theor. Comput. Sci. Gerald Lüttgen, Walter Vogler
2006	B	`conf`	Checking a Mutex Algorithm in a Process Algebra with Fairness. CONCUR Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2006	B	`conf`	Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics. FoSSaCS Gerald Lüttgen, Walter Vogler
2006	J	`jnl`	Fairness of Actions in System Computations. Acta Informatica Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2006	J	`jnl`	Fairness of components in system computations. Theor. Comput. Sci. Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2006	J	`jnl`	Merged processes: a new condensed representation of Petri net behaviour. Acta Informatica Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler
2006	—	`conf`	Strategies for Optimised STG Decomposition. ACSD Mark Schäfer, Walter Vogler, Ralf Wollowski, Victor Khomenko
2006	C	`conf`	Stronger Reduction Criteria for Local First Search. ICTAC Marcos E. Kurbán, Peter Niebert, Hongyang Qu, Walter Vogler
2005	B	`conf`	Bisimulation on Speed: A Unified Approach. FoSSaCS Gerald Lüttgen, Walter Vogler
2005	J	`jnl`	Bisimulation on speed: Lower time bounds. RAIRO Theor. Informatics Appl. Gerald Lüttgen, Walter Vogler
2005	B	`conf`	Component Refinement and CSC Solving for STG Decomposition. FoSSaCS Mark Schäfer, Walter Vogler
2005	—	`conf`	Determinate STG Decomposition of Marked Graphs. ICATPN Mark Schäfer, Walter Vogler, Petr Jancar
2005	—	`conf`	Improved Decomposition of STGs. ACSD Walter Vogler, Ben Kangsah
2005	J	`jnl`	Measuring the performance of asynchronous systems with PAFAS. Theor. Comput. Sci. Flavio Corradini, Walter Vogler
2005	B	`conf`	Merged Processes - A New Condensed Representation of Petri Net Behaviour. CONCUR Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler
2005	—	`conf`	Performance of Pipelined Asynchronous Systems. FORMATS Flavio Corradini, Walter Vogler
2004	B	`conf`	Bisimulation on Speed: Lower Time Bounds. FoSSaCS Gerald Lüttgen, Walter Vogler
2004	J	`jnl`	Bisimulation on speed: worst-case efficiency. Inf. Comput. Gerald Lüttgen, Walter Vogler
2004	—	`conf`	Fairness of Components in System Computations. EXPRESS Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2004	—	`conf`	Timed Petri Nets: Efficiency of Asynchronous Systems. SFM Elmar Bihler, Walter Vogler
2003	J	`jnl`	Canonical prefixes of Petri net unfoldings. Acta Informatica Victor Khomenko, Maciej Koutny, Walter Vogler
2003	J	`jnl`	Faster asynchronous systems. Inf. Comput. Walter Vogler
2003	—	`ed.`	Proceedings of the International Workshop on Models for Time-Critical Systems, MTCS 2002, CONCUR 2002 Satellite Workshop, Brno, Czech Republic, August 24, 2002 MTCS Walter Vogler, Kim Larsen
2003	B	`conf`	Relating Fairness and Timing in Process Algebras. CONCUR Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2002	J	`jnl`	An Improvement of McMillan's Unfolding Algorithm. Formal Methods Syst. Des. Javier Esparza, Stefan Römer, Walter Vogler
2002	A*	`conf`	Canonical Prefixes of Petri Net Unfoldings. CAV Victor Khomenko, Maciej Koutny, Walter Vogler
2002	J	`jnl`	Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica Flavio Corradini, Walter Vogler, Lars Jenner
2002	—	`conf`	Decomposition in Asynchronous Circuit Design. Concurrency and Hardware Design Walter Vogler, Ralf Wollowski
2002	—	`conf`	Decomposition in Asynchronous Circuit Design. FSTTCS Walter Vogler, Ralf Wollowski
2002	J	`jnl`	Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. Theor. Comput. Sci. Walter Vogler
2002	J	`jnl`	Partial order semantics and read arcs. Theor. Comput. Sci. Walter Vogler
2002	—	`conf`	Preface. MTCS Walter Vogler, Kim Larsen
2002	—	`ed.`	Proceedings of the International Workshop on Models for Time-Critical Systems, MTCS 2001, Satellite Event of CONCUR 2001, Aalborg, Denmark, August 25, 2001 MTCS Flavio Corradini, Walter Vogler
2001	B	`conf`	A Faster-than Relation for Asynchronous Processes. CONCUR Gerald Lüttgen, Walter Vogler
2001	J	`jnl`	Fast asynchronous systems in dense time. Theor. Comput. Sci. Lars Jenner, Walter Vogler
2001	—	`conf`	PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations. APAQS Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2001	—	`conf`	Partial S-Invariants for the Verification of Infinite Systems Families. ICATPN Walter Vogler
2001	—	`conf`	Preface. MTCS Flavio Corradini, Walter Vogler
2000	—	`conf`	Axiomatizing a Fragment of PAFAS. MTCS Walter Vogler, Lars Jenner
2000	—	`conf`	Efficiency of Asynchronous Systems That Communicate Asynchronously. ICATPN Walter Vogler
1999	—	`conf`	Comparing the Efficiency of Asynchronous Systems. ARTS Lars Jenner, Walter Vogler
1999	—	`conf`	Concurrent Implementation of Asynchronous Transition Systems. ICATPN Walter Vogler
1998	—	`conf`	Efficiency of Token-Passing MUTEX-Solutions - Some Experiments. ICATPN Elmar Bihler, Walter Vogler
1998	B	`conf`	Unfolding and Finite Prefix for Nets with Read Arcs. CONCUR Walter Vogler, Alexei L. Semenov, Alexandre Yakovlev
1997	—	`conf`	A Short STory on Action Refinement. Foundations of Computer Science: Potential - Theory - Cognition Walter Vogler
1997	A*	`conf`	Efficiency of Asynchronous Systems and Read Arcs in Petri Nets. ICALP Walter Vogler
1997	B	`conf`	Partial Order Semantics and Read Arcs. MFCS Walter Vogler
1996	A	`conf`	An Improvement of McMillan's Unfolding Algorithm. TACAS Javier Esparza, Stefan Römer, Walter Vogler
1996	C	`conf`	Applications of Fair Testing. FORTE Ed Brinksma, Arend Rensink, Walter Vogler
1996	A*	`conf`	Fast Asynchronous Systems in Dense Time. ICALP Lars Jenner, Walter Vogler
1996	J	`jnl`	The Limit of Split Inf. Comput. Walter Vogler
1995	B	`conf`	Fair Testing. CONCUR Ed Brinksma, Arend Rensink, Walter Vogler
1995	J	`jnl`	Fairness and Partial Order Semantics. Inf. Process. Lett. Walter Vogler
1995	B	`conf`	Faster Asynchronous Systems. CONCUR Walter Vogler
1995	J	`jnl`	Generalized OM-Bisimulation Inf. Comput. Walter Vogler
1995	—	`conf`	Partial Order Semantics and Weak Fairness. STRICT Walter Vogler
1995	A*	`conf`	The Limit of Split_n-Language Equivalence. ICALP Walter Vogler
1995	J	`jnl`	Timed Testing of Concurrent Systems Inf. Comput. Walter Vogler
1993	J	`jnl`	Bisimulation and Action Refinement. Theor. Comput. Sci. Walter Vogler
1993	J	`jnl`	On Hyperedge Replacement and BNLC Graph Grammars. Discret. Appl. Math. Walter Vogler
1993	A*	`conf`	Timed Testing of Concurrent Systems. ICALP Walter Vogler
1992	A*	`conf`	Asynchronous Communication of Petri Nets and the Refinement of Transitions. ICALP Walter Vogler
1992	—	`book`	Modular Construction and Partial Order Semantics of Petri Nets Walter Vogler
1992	—	`ch.`	Partial words versus processes: a short comparison. Advances in Petri Nets: The DEMON Project Walter Vogler
1992	J	`jnl`	Quality criteria for partial order semantics of place/transition-nets with capacities. Fundam. Informaticae Robert Gold, Walter Vogler
1991	J	`jnl`	A generalization of traces. RAIRO Theor. Informatics Appl. Walter Vogler
1991	J	`jnl`	Asynchronous communication of Petri nets and the refinements of transitions Forschungsberichte, TU Munich Walter Vogler
1991	A	`conf`	Bisimulation and Action Refinement. STACS Walter Vogler
1991	J	`jnl`	Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. Theor. Comput. Sci. Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
1991	A*	`conf`	Deciding History Preserving Bisimilarity. ICALP Walter Vogler
1991	J	`jnl`	Executions: A New Partial-Order Semantics of Petri Nets. Theor. Comput. Sci. Walter Vogler
1991	J	`jnl`	Failures Semantics Based on Interval Semiwords is a Congruence for Refinement. Distributed Comput. Walter Vogler
1991	J	`jnl`	Generalized OM-bisimulation Forschungsberichte, TU Munich Walter Vogler
1991	J	`jnl`	Is partial order semantics necessary for action refinement? Forschungsberichte, TU Munich Walter Vogler
1990	J	`jnl`	A generalization of trace theory Forschungsberichte, TU Munich Walter Vogler
1990	J	`jnl`	Bisimulation and action refinement Forschungsberichte, TU Munich Walter Vogler
1990	A	`conf`	Failures Semantics Based on Interval Semiwords is a Congruence for Refinement. STACS Walter Vogler
1990	J	`jnl`	Failures semantics of Petri nets and the refinement of places and transitions Forschungsberichte, TU Munich Walter Vogler
1990	B	`conf`	Quality Criteria for Partial Order Semantics of Place/Transition-Nets. MFCS Robert Gold, Walter Vogler
1990	J	`jnl`	Quality criteria for partial order semantics of place/transitions nets Forschungsberichte, TU Munich Robert Gold, Walter Vogler
1990	—	`conf`	Recognizing Edge Replacement Graph Languages in Cubic Time. Graph-Grammars and Their Application to Computer Science Walter Vogler
1990	J	`jnl`	Recognizing edge replacement graph languages in cubic time Forschungsberichte, TU Munich Walter Vogler
1989	—	`conf`	A survey of behaviour and equivalence preserving refinements of Petri nets. Applications and Theory of Petri Nets Wilfried Brauer, Robert Gold, Walter Vogler
1989	—	`conf`	Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. TAPSOFT, Vol.1 Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
1989	J	`jnl`	Failures Semantics and Deadlocking of Modular Petri Nets. Acta Informatica Walter Vogler
1989	J	`jnl`	Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages. Acta Informatica Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
1989	B	`conf`	On Hyperedge Replacement and BNLC Graph Grammars. WG Walter Vogler
1989	J	`jnl`	On the Synchronization of Traces. Math. Syst. Theory Volker Diekert, Walter Vogler
1989	J	`jnl`	Step Failures Semantics and a Complete Proof System. Acta Informatica Dirk Taubner, Walter Vogler
1988	B	`conf`	Failures Semantics and Deadlocking of Modular Petri Nets. MFCS Walter Vogler
1988	B	`conf`	Local Checking of Trace Synchroniziability. MFCS Volker Diekert, Walter Vogler
1988	—	`conf`	Representation of a swapping class by one net. European Workshop on Applications and Theory in Petri Nets Walter Vogler
1987	—	`conf`	An Improved Multiple Identification Algorithm for Synchronous Broadcasting Networks. WDAG Walter Vogler
1987	J	`jnl`	Complativle graph properties are decidable for hypergraph replacement graph languages. Bull. EATCS Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
1987	A	`conf`	The Step Failure Semantics. STACS Dirk Taubner, Walter Vogler
1986	B	`conf`	Behaviour Preserving Refinement of Petri Nets. WG Walter Vogler
1986	J	`jnl`	Representing abstract groups by powers of a graph. J. Comb. Theory B Walter Vogler
1985	J	`jnl`	Some remarks on universal graphs. Comb. Reinhard Diestel, Rudolf Halin, Walter Vogler
1985	J	`jnl`	The square of a connected S(K J. Graph Theory George Hendry, Walter Vogler
1984	J	`jnl`	Graphs with given group and given constant link. J. Graph Theory Walter Vogler