Undecidability of performance equivalence of Petri nets

We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable than in ordinary setting (which is the case, e.g., over communication-free ne...

Full description

Saved in:
Bibliographic Details
Main Authors Lasota, Slawomir, Poturalski, Marcin
Format Journal Article
LanguageEnglish
Published 30.10.2009
Subjects
Computer Science - Computational Complexity
Computer Science - Performance
Online AccessGet full text

Cover

More Information
Summary:We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable than in ordinary setting (which is the case, e.g., over communication-free nets). We disprove this conjecture in three of four proposed variants of durational semantics. The fourth variant remains an intriguing open problem.
DOI:10.48550/arxiv.0910.5819