Undecidability of weak bisimulation equivalence for 1-counter processes

Authors:
Richard Mayr
Affiliations:
Department of Computer Science, Albert-Ludwigs-University Freiburg, Freiburg, Germany
Venue:
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Year:
2003

Citing 11
Cited 8

Undecidability of bisimilarity for Petri nets and some related problems

STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Process rewrite systems

Information and Computation - Special issue on EXPRESS 1997
Decidability of bisimilarity for one-counter processes

Information and Computation
Communication and Concurrency

Communication and Concurrency
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
The Joys of Bisimulation

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Undecidability of Weak Bisimilarity for Pushdown Processes

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines
Undecidability of weak bisimilarity for PA-processes

DLT'02 Proceedings of the 6th international conference on Developments in language theory

DP Lower bounds for equivalence-checking and model-checking of one-counter automata

Information and Computation
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard

Theoretical Computer Science - Expressiveness in concurrency
Equivalence-checking on infinite-state systems: Techniques and results

Theory and Practice of Logic Programming
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes

Information and Computation
Bisimilarity of one-counter processes is PSPACE-complete

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Language equivalence of deterministic real-time one-counter automata is NL-complete

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Equivalence of deterministic one-counter automata is NL-complete

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Decidability of Weak Simulation on One-Counter Nets

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that checking weak bisimulation equivalence of 1-counter nets (Petri nets with only one unbounded place) is undecidable. This implies the undecidability of weak bisimulation equivalence for 1-counter machines. The undecidability result carries over to normed 1-counter nets/machines.