Walter Vogler

According to our database1, Walter Vogler
  • authored at least 137 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Testing Preorders for dMTS: Deadlock- and the New Deadlock-/DivergenceTesting.
ACM Trans. Embedded Comput. Syst., 2017

Deciding conformance for bounded responsiveness.
Sci. Comput. Program., 2017

2016
Nondeterministic Modal Interfaces.
Theor. Comput. Sci., 2016

Fair Testing and Stubborn Sets.
Proceedings of the Model Checking Software - 23rd International Symposium, 2016

ACTL for Modal Interface Automata.
Proceedings of the 16th International Conference on Application of Concurrency to System Design, 2016

2015
Failure Semantics for Modal Transition Systems.
ACM Trans. Embedded Comput. Syst., 2015

Error-pruning in interface automata.
Theor. Comput. Sci., 2015

Richer interface automata with optimistic and pessimistic compatibility.
Acta Inf., 2015

Nondeterministic Modal Interfaces.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing.
Proceedings of the 15th International Conference on Application of Concurrency to System Design, 2015

2014
Recent advances in unfolding technique.
Theor. Comput. Sci., 2014

Undecidability of accordance for open systems with unbounded message queues.
Inf. Process. Lett., 2014

Trace- and failure-based semantics for responsiveness.
Acta Inf., 2014

Error-Pruning in Interface Automata.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Failure Semantics for Modal Transition Systems.
Proceedings of the 14th International Conference on Application of Concurrency to System Design, 2014

2013
Richer Interface Automata with Optimistic and Pessimistic Compatibility.
ECEASST, 2013

Modal Interface Automata.
Logical Methods in Computer Science, 2013

Trace- and Failure-Based Semantics for Bounded Responsiveness.
Proceedings of the Advances in Service-Oriented and Cloud Computing, 2013

STG-Based Resynthesis for Balsa Circuits.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2012
A trace-based service semantics guaranteeing deadlock freedom.
Acta Inf., 2012

Modal Interface Automata.
Proceedings of the Theoretical Computer Science, 2012

A Trace-Based Semantics for Responsiveness.
Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011
Safe reasoning with Logic LTS.
Theor. Comput. Sci., 2011

Signal transition graph decomposition: internal communication for speed independent circuit implementation.
IET Computers & Digital Techniques, 2011

Preface.
Fundam. Inform., 2011

Read Operators and their Expressiveness in Process Algebras
Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

Automated Analysis of MUTEX Algorithms with FASE
Proceedings of Second International Symposium on Games, 2011

Evaluating the Efficiency of Asynchronous Systems with FASE
CoRR, 2011

A Trace-Based View on Operating Guidelines.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

STG Decomposition: Partitioning Heuristics.
Proceedings of the 11th International Conference on Application of Concurrency to System Design, 2011

2010
Ready simulation for concurrency: It's logical!
Inf. Comput., 2010

STG Decomposition: Internal Communication for SI Implementability.
Proceedings of the 10th International Conference on Application of Concurrency to System Design, 2010

2009
Avoiding Irreducible CSC Conflicts by Internal Communication.
Fundam. Inform., 2009

Robustness of a bisimulation-type faster-than preorder
Proceedings of the Proceedings 16th International Workshop on Expressiveness in Concurrency, 2009

STG decomposition strategies in combination with unfolding.
Acta Inf., 2009

Liveness of a mutex algorithm in a fair process algebra.
Acta Inf., 2009

Safe Reasoning with Logic LTS.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Time and Fairness in a Process Algebra with Non-blocking Reading.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2008
Another short proof of optimality for the MIN cache replacement algorithm.
Inf. Process. Lett., 2008

Output-Determinacy and Asynchronous Circuit Synthesis.
Fundam. Inform., 2008

Avoiding irreducible CSC conflicts by internal communication.
Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), 2008

2007
Component refinement and CSC-solving for STG decomposition.
Theor. Comput. Sci., 2007

Conjunction on processes: Full abstraction via ready-tree semantics.
Theor. Comput. Sci., 2007

Performance of pipelined asynchronous systems.
J. Log. Algebr. Program., 2007

Fair testing.
Inf. Comput., 2007

Improved Decomposition of Signal Transition Graphs.
Fundam. Inform., 2007

Ready Simulation for Concurrency: It's Logical!
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Output-Determinacy and Asynchronous Circuit Synthesis.
Proceedings of the Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 2007

2006
Bisimulation on speed: A unified approach.
Theor. Comput. Sci., 2006

Fairness of components in system computations.
Theor. Comput. Sci., 2006

Merged processes: a new condensed representation of Petri net behaviour.
Acta Inf., 2006

Fairness of Actions in System Computations.
Acta Inf., 2006

Stronger Reduction Criteria for Local First Search.
Proceedings of the Theoretical Aspects of Computing, 2006

Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

Checking a Mutex Algorithm in a Process Algebra with Fairness.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Strategies for Optimised STG Decomposition.
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.
Theor. Comput. Sci., 2005

Bisimulation on speed: Lower time bounds.
ITA, 2005

Fairness of Components in System Computations.
Electr. Notes Theor. Comput. Sci., 2005

Component Refinement and CSC Solving for STG Decomposition.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

Bisimulation on Speed: A Unified Approach.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

Performance of Pipelined Asynchronous Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

Merged Processes - A New Condensed Representation of Petri Net Behaviour.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Determinate STG Decomposition of Marked Graphs.
Proceedings of the Applications and Theory of Petri Nets 2005, 2005

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

2004
Bisimulation on speed: worst-case efficiency.
Inf. Comput., 2004

Timed Petri Nets: Efficiency of Asynchronous Systems.
Proceedings of the Formal Methods for the Design of Real-Time Systems, 2004

Bisimulation on Speed: Lower Time Bounds.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Faster asynchronous systems.
Inf. Comput., 2003

Preface.
Electr. Notes Theor. Comput. Sci., 2003

Canonical prefixes of Petri net unfoldings.
Acta Inf., 2003

Relating Fairness and Timing in Process Algebras.
Proceedings of the CONCUR 2003, 2003

2002
Partial order semantics and read arcs.
Theor. Comput. Sci., 2002

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

An Improvement of McMillan's Unfolding Algorithm.
Formal Methods in System Design, 2002

Comparing the worst-case efficiency of asynchronous systems with PAFAS.
Acta Inf., 2002

Decomposition in Asynchronous Circuit Design.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

Canonical Prefixes of Petri Net Unfoldings.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

Decomposition in Asynchronous Circuit Design.
Proceedings of the Concurrency and Hardware Design, Advances in Petri Nets, 2002

2001
Fast asynchronous systems in dense time.
Theor. Comput. Sci., 2001

Preface.
Electr. Notes Theor. Comput. Sci., 2001

A Faster-than Relation for Asynchronous Processes.
Proceedings of the CONCUR 2001, 2001

Partial S-Invariants for the Verification of Infinite Systems Families.
Proceedings of the Application and Theory of Petri Nets 2001, 2001

PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations.
Proceedings of the 2nd Asia-Pacific Conference on Quality Software (APAQS 2001), 2001

2000
Axiomatizing a Fragment of PAFAS.
Electr. Notes Theor. Comput. Sci., 2000

Efficiency of Asynchronous Systems That Communicate Asynchronously.
ICATPN, 2000

1999
Comparing the Efficiency of Asynchronous Systems.
Proceedings of the Formal Methods for Real-Time and Probabilistic Systems, 1999

Concurrent Implementation of Asynchronous Transition Systems.
Proceedings of the Application and Theory of Petri Nets 1999, 1999

1998
Unfolding and Finite Prefix for Nets with Read Arcs.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

Efficiency of Token-Passing MUTEX-Solutions - Some Experiments.
Proceedings of the Application and Theory of Petri Nets 1998, 1998

1997
Partial Order Semantics and Read Arcs.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Efficiency of Asynchronous Systems and Read Arcs in Petri Nets.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

A Short STory on Action Refinement.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
The Limit of Splitn-Language Equivalence.
Inf. Comput., 1996

An Improvement of McMillan's Unfolding Algorithm.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1996

Fast Asynchronous Systems in Dense Time.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Applications of Fair Testing.
Proceedings of the Formal Description Techniques IX: Theory, 1996

1995
Timed Testing of Concurrent Systems
Inf. Comput., September, 1995

Generalized OM-Bisimulation
Inf. Comput., April, 1995

Fairness and Partial Order Semantics.
Inf. Process. Lett., 1995

The Limit of Split_n-Language Equivalence.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Faster Asynchronous Systems.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

Fair Testing.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1993
Bisimulation and Action Refinement.
Theor. Comput. Sci., 1993

On Hyperedge Replacement and BNLC Graph Grammars.
Discrete Applied Mathematics, 1993

Timed Testing of Concurrent Systems.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Quality criteria for partial order semantics of place/transition-nets with capacities.
Fundam. Inform., 1992

Asynchronous Communication of Petri Nets and the Refinement of Transitions.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Partial words versus processes: a short comparison.
Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

Modular Construction and Partial Order Semantics of Petri Nets
Lecture Notes in Computer Science 625, Springer, ISBN: 3-540-55767-9, 1992

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

Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement.
Theor. Comput. Sci., 1991

A generalization of traces.
ITA, 1991

Failures Semantics Based on Interval Semiwords is a Congruence for Refinement.
Distributed Computing, 1991

Bisimulation and Action Refinement.
Proceedings of the STACS 91, 1991

Deciding History Preserving Bisimilarity.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Failures Semantics Based on Interval Semiwords is a Congruence for Refinement.
Proceedings of the STACS 90, 1990

Quality Criteria for Partial Order Semantics of Place/Transition-Nets.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Recognizing Edge Replacement Graph Languages in Cubic Time.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1989
On the Synchronization of Traces.
Mathematical Systems Theory, 1989

Failures Semantics and Deadlocking of Modular Petri Nets.
Acta Inf., 1989

Step Failures Semantics and a Complete Proof System.
Acta Inf., 1989

Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages.
Acta Inf., 1989

On Hyperedge Replacement and BNLC Graph Grammars.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar.
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.
Proceedings of the Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, 1989

1988
Failures Semantics and Deadlocking of Modular Petri Nets.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Local Checking of Trace Synchroniziability.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Representation of a swapping class by one net.
Proceedings of the Advances in Petri Nets 1989, 1988

1987
Complativle graph properties are decidable for hypergraph replacement graph languages.
Bulletin of the EATCS, 1987

An Improved Multiple Identification Algorithm for Synchronous Broadcasting Networks.
Proceedings of the Distributed Algorithms, 1987

The Step Failure Semantics.
Proceedings of the STACS 87, 1987

1986
Representing abstract groups by powers of a graph.
J. Comb. Theory, Ser. B, 1986

Behaviour Preserving Refinement of Petri Nets.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1985
The square of a connected S(K1, 3)-free graph is vertex pancyclic.
Journal of Graph Theory, 1985

Some remarks on universal graphs.
Combinatorica, 1985

1984
Graphs with given group and given constant link.
Journal of Graph Theory, 1984


  Loading...