Petri nets and the equivalence problem

Yoram Hirshfeld

doi:10.1007/bfb0049331

Petri nets and the equivalence problem

Yoram Hirshfeld

School of Mathematical Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 language	English
Title of host publication	Computer Science Logic - 7th Workshop, CSL 1993, Selected Papers
Editors	Egon Borger, Yuri Gurevich, Karl Meinke
Publisher	Springer Verlag
Pages	165-174
Number of pages	10
ISBN (Print)	9783540582779
DOIs	https://doi.org/10.1007/bfb0049331
State	Published - 1994
Event	7th Workshop on Computer Science Logic, CSL 1993 - Swansea, United Kingdom Duration: 13 Sep 1993 → 17 Sep 1993

Publication series

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

Conference

Conference	7th Workshop on Computer Science Logic, CSL 1993
Country/Territory	United Kingdom
City	Swansea
Period	13/09/93 → 17/09/93

Access to Document

10.1007/bfb0049331

Cite this

Hirshfeld, Y. (1994). Petri nets and the equivalence problem. In E. Borger, Y. Gurevich, & K. Meinke (Eds.), Computer Science Logic - 7th Workshop, CSL 1993, Selected Papers (pp. 165-174). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 832 LNCS). Springer Verlag. https://doi.org/10.1007/bfb0049331

@inproceedings{235a7ec6331846a3b26e32d907631ffa,

title = "Petri nets and the equivalence problem",

abstract = "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.",

author = "Yoram Hirshfeld",

year = "1994",

doi = "10.1007/bfb0049331",

language = "אנגלית",

isbn = "9783540582779",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "165--174",

editor = "Egon Borger and Yuri Gurevich and Karl Meinke",

booktitle = "Computer Science Logic - 7th Workshop, CSL 1993, Selected Papers",

}

Hirshfeld, Y 1994, Petri nets and the equivalence problem. in E Borger, Y Gurevich & K Meinke (eds), Computer Science Logic - 7th Workshop, CSL 1993, Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 832 LNCS, Springer Verlag, pp. 165-174, 7th Workshop on Computer Science Logic, CSL 1993, Swansea, United Kingdom, 13/09/93. https://doi.org/10.1007/bfb0049331

Petri nets and the equivalence problem. / Hirshfeld, Yoram.

Computer Science Logic - 7th Workshop, CSL 1993, Selected Papers. ed. / Egon Borger; Yuri Gurevich; Karl Meinke. Springer Verlag, 1994. p. 165-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 832 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Petri nets and the equivalence problem

AU - Hirshfeld, Yoram

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84995875473&partnerID=8YFLogxK

U2 - 10.1007/bfb0049331

DO - 10.1007/bfb0049331

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84995875473

SN - 9783540582779

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 165

EP - 174

BT - Computer Science Logic - 7th Workshop, CSL 1993, Selected Papers

A2 - Borger, Egon

A2 - Gurevich, Yuri

A2 - Meinke, Karl

PB - Springer Verlag

Y2 - 13 September 1993 through 17 September 1993

ER -

Petri nets and the equivalence problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this