Synthesis of (choice-free) reset nets
From MaRDI portal
Publication:2117175
DOI10.1007/978-3-030-76983-3_14zbMATH Open1489.68156OpenAlexW3172178281MaRDI QIDQ2117175FDOQ2117175
Authors: Raymond Devillers
Publication date: 21 March 2022
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/331405/3/synthreset.pdf
Recommendations
Cites Work
- A new polynomial-time algorithm for linear programming
- Parallel program schemata
- Free Choice Petri Nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- The synthesis problem of Petri nets
- Some decision problems related to the reachability problem for Petri nets
- Title not available (Why is that?)
- Synthesis of Persistent Systems
- Characterisation of the state spaces of live and bounded marked graph Petri nets
- Petri net synthesis
- 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
- Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
- Analysis and synthesis of weighted marked graph Petri nets
- Target-oriented Petri net synthesis
- A new property of choice-free Petri net systems
Cited In (5)
Uses Software
This page was built for publication: Synthesis of (choice-free) reset nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117175)