Petri nets and the equivalence problem

Yoram Hirshfeld*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We prove that trace equivalence is undecidable for the very small and natural subclass of Petri nets in which no transition requires more than one token; this subclass corresponds exactly to the calculus BPP of Christensen for which bisimulation equivalence is known to be decidable. We present this result along with a survey of decidability results for various notions of equivalence with respect to various subclasses of Petri nets.

Original languageEnglish
Title of host publicationComputer Science Logic - 7th Workshop, CSL 1993, Selected Papers
EditorsEgon Borger, Yuri Gurevich, Karl Meinke
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540582779
StatePublished - 1994
Event7th Workshop on Computer Science Logic, CSL 1993 - Swansea, United Kingdom
Duration: 13 Sep 199317 Sep 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume832 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th Workshop on Computer Science Logic, CSL 1993
Country/TerritoryUnited Kingdom


Dive into the research topics of 'Petri nets and the equivalence problem'. Together they form a unique fingerprint.

Cite this