Synthesis of (choice-free) reset nets
From MaRDI portal
Publication:2117175
Recommendations
Cites work
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- scientific article; zbMATH DE number 3471613 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A new property of choice-free Petri net systems
- Analysis and synthesis of weighted marked graph Petri nets
- Bounded choice-free Petri net synthesis: algorithmic issues
- Characterisation of the state spaces of live and bounded marked graph Petri nets
- Free Choice Petri Nets
- Over-approximative Petri net synthesis for restricted subclasses of nets
- Parallel program schemata
- Petri net synthesis
- Some decision problems related to the reachability problem for Petri nets
- Synthesis of Persistent Systems
- Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
- Target-oriented Petri net synthesis
- The synthesis problem for elementary net systems is NP-complete
- The synthesis problem of Petri nets
Cited in
(5)- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
- Presynthesis of bounded choice-free or fork-attribution nets
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1405652 (Why is no real title available?)
- Compositional generation of home states in free choice nets
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)