A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets

DOI10.1016/S0304-3975(98)00351-XzbMath0930.68093OpenAlexW1980791422MaRDI QIDQ1960543

Alain Finkel, Catherine Dufourd

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00351-x

zbMATH Keywords

verificationPetri netsequivalencesconcurrency

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Unnamed Item

Cites Work

• Some decision problems related to the reachability problem for Petri nets
• Homomorphisms between models of parallel computation
• Normalization of place/transition-systems preserves net behaviour
• Branching time and abstraction in bisimulation semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item