Sufficient conditions for the marked graph realisability of labelled transition systems

DOI10.1016/J.TCS.2017.10.006MaRDI QIDQ1623288zbMATH OpenOpenAlexFDO

Authors Eike Best, Thomas Hujsa, Harro Wimmel

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)

Recommendations

• Deriving labelled transition systems -- a structural approach
• Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
• scientific article; zbMATH DE number 1107491
• scientific article; zbMATH DE number 3934418
• scientific article; zbMATH DE number 3872693
• Characterisation of the state spaces of marked graph Petri nets
• Realizability of graph specifications: characterizations and algorithms
• scientific article; zbMATH DE number 1864591
• Submarking reachability of marked graphs

Cites work

• scientific article; zbMATH DE number 4018378 (Why is no real title available?)
• scientific article; zbMATH DE number 3757689 (Why is no real title available?)
• scientific article; zbMATH DE number 3471613 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• A decidability theorem for a class of vector-addition systems
• A decomposition theorem for finite persistent transition systems
• Characterisation of the state spaces of marked graph Petri nets
• Free Choice Petri Nets
• Marked directed graphs
• Petri net synthesis
• Properties of Conflict-Free and Persistent Petri Nets
• Separability in Conflict-Free Petri Nets
• Separability in persistent Petri nets
• Soundness and separability of workflow nets in the stepwise refinement approach
• Soundness of workflow nets: classification, decidability, and analysis

Cited in

(16)

• Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
• Augmented marked graphs
• On synthesis and analysis of generalized work flow net structures and transition graphs
• scientific article; zbMATH DE number 2088665 (Why is no real title available?)
• Characterisation of the state spaces of live and bounded marked graph Petri nets
• scientific article; zbMATH DE number 1912023 (Why is no real title available?)
• Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
• State space axioms for T-systems
• The power of prime cycles
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• Making Petri nets safe and free of internal transitions
• Analysis and synthesis of weighted marked graph Petri nets
• Synthesis of Petri nets with restricted place-environments: classical and parameterized
• Boundedness and conservativeness of augmented marked graphs
• Characterisation of the state spaces of marked graph Petri nets
• Plain, bounded, reversible, persistent, and k-marked Petri nets have marked graph reachability graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623288)