Synthesis of bounded choice-free Petri nets
From MaRDI portal
Publication:5357699
Recommendations
Cited in
(22)- Free Choice Petri Nets
- Synthesis of (choice-free) reset nets
- The Complexity of Synthesis of b-Bounded Petri Nets
- Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
- Target-oriented Petri net synthesis
- A new property of choice-free Petri net systems
- Presynthesis of bounded choice-free or fork-attribution nets
- Synthesis for various Petri net classes with union/find
- Synthesis and reengineering of persistent systems
- Reduction and synthesis of live and bounded free choice Petri nets
- The power of prime cycles
- Petri Net Synthesis for Restricted Classes of Nets
- Factorisation of transition systems
- \(k\)-bounded Petri net synthesis from modal transition systems
- Conditions for Petri net solvable binary words
- Synthesis of live and bounded persistent systems
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
- Bounded choice-free Petri net synthesis: algorithmic issues
- Characterising Petri net solvable binary words
- Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- Characterisation of the state spaces of marked graph Petri nets
This page was built for publication: Synthesis of bounded choice-free Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357699)
