Bounded choice-free Petri net synthesis: algorithmic issues
From MaRDI portal
Publication:1789066
Recommendations
Cites work
- scientific article; zbMATH DE number 3825182 (Why is no real title available?)
- scientific article; zbMATH DE number 3471613 (Why is no real title available?)
- scientific article; zbMATH DE number 1302048 (Why is no real title available?)
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- A decidability theorem for a class of vector-addition systems
- A decomposition theorem for finite persistent transition systems
- Characterisation of the state spaces of marked graph Petri nets
- Characterising Petri net solvable binary words
- Deriving Petri nets from finite transition systems
- Distributing finite automata through Petri net synthesis
- Free Choice Petri Nets
- Logic Synthesis for Asynchronous Controllers and Interfaces
- Marked directed graphs
- New Region-Based Algorithms for Deriving Bounded Petri Nets
- On Distributability of Petri Nets
- Partial (set) 2-structures. I: Basic notions and the representation problems
- Petri net distributability
- Petri net synthesis
- Polynomial algorithms for the synthesis of bounded nets
- Properties of Conflict-Free and Persistent Petri Nets
- State space axioms for T-systems
- Synthesis and reengineering of persistent systems
- Synthesis of Persistent Systems
- Synthesis of bounded choice-free Petri nets
- Synthesis of live and bounded persistent systems
- The label splitting problem
- The synthesis problem for elementary net systems is NP-complete
Cited in
(22)- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
- Synthesis of (choice-free) reset nets
- The Complexity of Synthesis of b-Bounded Petri Nets
- Target-oriented Petri net synthesis
- A new property of choice-free Petri net systems
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
- Synthesis of bounded choice-free Petri nets
- Presynthesis of bounded choice-free or fork-attribution nets
- Reduction and synthesis of live and bounded free choice Petri nets
- Over-approximative Petri net synthesis for restricted subclasses of nets
- \(k\)-bounded Petri net synthesis from modal transition systems
- Synthesis of live and bounded persistent systems
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions
- Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
- Articulation of Transition Systems and Its Application to Petri Net Synthesis
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
This page was built for publication: Bounded choice-free Petri net synthesis: algorithmic issues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789066)
