Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets

DOI10.1016/J.IPL.2005.03.002zbMath1182.68138OpenAlexW2070402943MaRDI QIDQ1041759

Philippe Darondeau

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.03.002

zbMATH Keywords

Petri netconcurrencyboundedpersistentminimal automaton

Mathematics Subject Classification ID

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

Related Items (3)

Decomposition Theorems for Bounded Persistent Petri Nets ⋮ A Graph-Theoretical Characterisation of State Separation ⋮ A decomposition theorem for finite persistent transition systems

Cites Work

• Unnamed Item
• Concurrent transition systems
• The decidability of persistence for vector addition systems
• Persistence of vector replacement systems is decidable
• Properties of Conflict-Free and Persistent Petri Nets
• Polynomial algorithms for the synthesis of bounded nets

This page was built for publication: Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets