State space axioms for T-systems

DOI10.1007/s00236-015-0219-0zbMath1317.68129OpenAlexW2018016296MaRDI QIDQ2340253

Raymond Devillers, Eike Best

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

synthesisPetri netslabelled transition systemsT-systemsmarked graphs

Mathematics Subject Classification ID

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

Related Items (7)

A New Property of Choice-Free Petri Net Systems ⋮ Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ 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 ⋮ Target-oriented Petri Net Synthesis

Cites Work

• Unnamed Item
• Unnamed Item
• A decidability theorem for a class of vector-addition systems
• Complexity of some problems in Petri nets
• Marked directed graphs
• Synchronisationsgraphen
• Synthesis of Persistent Systems
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2005

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