In: Volume 2719 of Lecture Notes in Computer Science, pages 570-583. January 2003.
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.
Keywords: 1-counter nets; 1-counter machines; bisimulation.