A decomposition theorem for finite persistent transition systems

DOI10.1007/s00236-009-0095-6zbMath1166.68029OpenAlexW1977456141MaRDI QIDQ1015394

Eike Best, Philippe Darondeau

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

zbMATH Keywords

finite labelled transition systems

Mathematics Subject Classification ID

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

Related Items (12)

Sufficient conditions for the marked graph realisability of labelled transition systems ⋮ Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ A New Property of Choice-Free Petri Net Systems ⋮ A Graph-Theoretical Characterisation of State Separation ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ Synthesis of Persistent Systems ⋮ Synthesis and reengineering of persistent systems ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ The Power of Prime Cycles ⋮ Using transition set sequences to partition behaviors of Petri nets ⋮ Target-oriented Petri Net Synthesis ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized

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

This page was built for publication: A decomposition theorem for finite persistent transition systems