Informatics Report Series
|
|
|
|
|
|
Title:Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes |
Authors:
Richard Mayr
|
Date:Jun 2003 |
Publication Title:Proc. of the International Colloquium on Automata, Languages and Programming (ICALP 2003) |
Publication Type:Conference Paper
Publication Status:Published
|
|
ISBN/ISSN:978-3-540-40493-4
|
- 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 the normed 1-counter nets/machines.
- Links To Paper
- 1st link
- Bibtex format
- @InProceedings{EDI-INF-RR-1198,
- author = {
Richard Mayr
},
- title = {Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes},
- book title = {Proc. of the International Colloquium on Automata, Languages and Programming (ICALP 2003)},
- year = 2003,
- month = {Jun},
- url = {http://www.springerlink.com/content/r1dayjqb7lf7pct8},
- }
|