State space axioms for T-systems

DOI10.1007/S00236-015-0219-0MaRDI QIDQ2340253zbMATH OpenOpenAlexFDO

Authors Eike Best, Raymond Devillers

Publication date 16 April 2015

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-015-0219-0

zbMATH Keywords

labelled transition systemsmarked graphsPetri netssynthesisT-systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

The authors define T-systems as Petri nets without forward or backward branching places. In contrast to marked graphs, places without input- or output-transitions are allowed. The paper characterises (finite or infinite) labelled transition systems which are isomorphic to state spaces of T-systems and provides synthesis algorithms for T-systems from labelled transition systems satisfying the characterising properties.

Recommendations

• Characterisation of the state spaces of marked graph Petri nets
• Sufficient conditions for the marked graph realisability of labelled transition systems
• Synthesis and reengineering of persistent systems
• Analysis of Petri nets and transition systems
• Characterisation of the state spaces of live and bounded marked graph Petri nets

Cites work

• A decidability theorem for a class of vector-addition systems
• Applications and Theory of Petri Nets 2005
• Characterisation of the state spaces of live and bounded marked graph Petri nets
• Complexity of some problems in Petri nets
• scientific article; zbMATH DE number 3471613 (Why is no real title available?)
• scientific article; zbMATH DE number 1302048 (Why is no real title available?)
• Lectures on Concurrency and Petri Nets
• Marked directed graphs
• Synchronisationsgraphen
• Synthesis of Persistent Systems

Cited in

(7)

• Bounded choice-free Petri net synthesis: algorithmic issues
• Presynthesis of bounded choice-free or fork-attribution nets
• Petri Net Synthesis for Restricted Classes of Nets
• Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
• Target-oriented Petri net synthesis
• A new property of choice-free Petri net systems
• Characterisation of the state spaces of marked graph Petri nets

This page was built for publication: State space axioms for T-systems

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