Synthesis of Persistent Systems

DOI10.1007/978-3-319-07734-5_7zbMath1334.68146OpenAlexW1577372958MaRDI QIDQ5166759

Eike Best, Raymond Devillers

Publication date: 8 July 2014

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07734-5_7

zbMATH Keywords

Petri netspersistencylabelled transition systemsParikh vectorssystem synthesisregion theorycyclic behaviourreengineering

Mathematics Subject Classification ID

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

Related Items (6)

Characterisation of the state spaces of marked graph Petri nets ⋮ Synthesis and reengineering of persistent systems ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Target-oriented Petri Net Synthesis ⋮ State space axioms for T-systems ⋮ Synthesis of (choice-free) reset nets

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Petri net synthesis
• A decomposition theorem for finite persistent transition systems
• Petri Net Distributability
• Properties of Conflict-Free and Persistent Petri Nets
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets

This page was built for publication: Synthesis of Persistent Systems