Petri nets are less expressive than state-extended PA

We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key words: Petri nets, process algebras, strong bisimulation, expressiveness

• Type: Journal
• Year: 2008
• Where: TCS
• Authors: Mojmír Kretínský, Vojtech Rehák, Jan Strejcek
• Keywords: Bisimulation Equivalence, Finite State Control, Petri Nets, TCS 2008, Theoretical Computer Science