Sufficient conditions for the marked graph realisability of labelled transition systems

DOI10.1016/j.tcs.2017.10.006zbMath1473.68112OpenAlexW2763847243MaRDI QIDQ1623288

Harro Wimmel, Thomas Hujsa, Eike Best

Publication date: 23 November 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.10.006

zbMATH Keywords

synthesisPetri netlabelled transition systemrealisabilitymarked graph

Mathematics Subject Classification ID

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

Related Items (3)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterisation of the state spaces of marked graph Petri nets
• Soundness of workflow nets: classification, decidability, and analysis
• Petri net synthesis
• A decomposition theorem for finite persistent transition systems
• A decidability theorem for a class of vector-addition systems
• Marked directed graphs
• Separability in Conflict-Free Petri Nets
• Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach
• Properties of Conflict-Free and Persistent Petri Nets
• Free Choice Petri Nets

This page was built for publication: Sufficient conditions for the marked graph realisability of labelled transition systems