Characterisation of the state spaces of marked graph Petri nets

DOI10.1016/j.ic.2016.06.006zbMath1409.68183OpenAlexW2210149873MaRDI QIDQ515678

Eike Best, Raymond Devillers

Publication date: 16 March 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.06.006

zbMATH Keywords

Petri netslabelled transition systemsmarked graphsreachability graphregion theory Petri net synthesis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Sufficient conditions for the marked graph realisability of labelled transition systems ⋮ A New Property of Choice-Free Petri Net Systems ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ Presynthesis of bounded choice-free or fork-attribution nets ⋮ The Power of Prime Cycles ⋮ Target-oriented Petri Net Synthesis ⋮ Conditions for Petri Net Solvable Binary Words

Cites Work

• Petri net synthesis
• Partial (set) 2-structures. II: State spaces of concurrent systems
• A decomposition theorem for finite persistent transition systems
• Synthesis and reengineering of persistent systems
• State space axioms for T-systems
• Marked directed graphs
• Synchronisationsgraphen
• Synthesis of Live and Bounded Persistent Systems
• Properties of Conflict-Free and Persistent Petri Nets
• Synthesis of Persistent Systems
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
• Lectures on Concurrency and Petri Nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterisation of the state spaces of marked graph Petri nets