Synthesis of (choice-free) reset nets

DOI10.1007/978-3-030-76983-3_14zbMath1489.68156OpenAlexW3172178281MaRDI QIDQ2117175

Raymond Devillers

Publication date: 21 March 2022

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/331405/3/synthreset.pdf

zbMATH Keywords

synthesislabelled transition systemsreset netschoice-freeness

Mathematics Subject Classification ID

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

Related Items (1)

Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues

Uses Software

• APT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Petri net synthesis
• Some decision problems related to the reachability problem for Petri nets
• The synthesis problem for elementary net systems is NP-complete
• Over-approximative Petri net synthesis for restricted subclasses of nets
• Bounded choice-free Petri net synthesis: algorithmic issues
• The synthesis problem of Petri nets
• Analysis and synthesis of weighted marked graph Petri nets
• Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
• Parallel program schemata
• Free Choice Petri Nets
• Target-oriented Petri Net Synthesis
• A New Property of Choice-Free Petri Net Systems
• Synthesis of Persistent Systems
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets

This page was built for publication: Synthesis of (choice-free) reset nets