Bounded choice-free Petri net synthesis: algorithmic issues

DOI10.1007/s00236-017-0310-9zbMath1400.68131OpenAlexW2769408352MaRDI QIDQ1789066

Eike Best, Raymond Devillers, Uli Schlachter

Publication date: 9 October 2018

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-017-0310-9

Mathematics Subject Classification ID

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

Related Items (11)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues ⋮ A New Property of Choice-Free Petri Net Systems ⋮ Articulation of Transition Systems and Its Application to Petri Net Synthesis ⋮ Unnamed Item ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ Target-oriented Petri Net Synthesis ⋮ Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis ⋮ Synthesis of (choice-free) reset nets ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized

Uses Software

• SMTInterpol
• Petrify
• GitHub
• APT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterisation of the state spaces of marked graph Petri nets
• Petri net synthesis
• Partial (set) 2-structures. I: Basic notions and the representation problems
• A decomposition theorem for finite persistent transition systems
• A decidability theorem for a class of vector-addition systems
• The synthesis problem for elementary net systems is NP-complete
• Distributing finite automata through Petri net synthesis
• Synthesis and reengineering of persistent systems
• State space axioms for T-systems
• Marked directed graphs
• Synthesis of Live and Bounded Persistent Systems
• Characterising Petri Net Solvable Binary Words
• On Distributability of Petri Nets
• Petri Net Distributability
• A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
• Properties of Conflict-Free and Persistent Petri Nets
• Deriving Petri nets from finite transition systems
• Logic Synthesis for Asynchronous Controllers and Interfaces
• Free Choice Petri Nets
• The Label Splitting Problem
• Polynomial algorithms for the synthesis of bounded nets
• Synthesis of Persistent Systems
• New Region-Based Algorithms for Deriving Bounded Petri Nets

This page was built for publication: Bounded choice-free Petri net synthesis: algorithmic issues