A decomposition theorem for finite persistent transition systems
From MaRDI portal
Publication:1015394
DOI10.1007/s00236-009-0095-6zbMath1166.68029MaRDI QIDQ1015394
Publication date: 8 May 2009
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-009-0095-6
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Synthesis of Persistent Systems, Characterisation of the state spaces of marked graph Petri nets, Using transition set sequences to partition behaviors of Petri nets, Bounded choice-free Petri net synthesis: algorithmic issues, Synthesis and reengineering of persistent systems, The Power of Prime Cycles, A Graph-Theoretical Characterisation of State Separation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
- The decidability of persistence for vector addition systems
- On weak persistency of Petri nets
- Marked directed graphs
- Separability in Conflict-Free Petri Nets
- Properties of Conflict-Free and Persistent Petri Nets
- Free Choice Petri Nets