The synthesis problem for elementary net systems is NP-complete
From MaRDI portal
Publication:1389765
Recommendations
Cites work
- scientific article; zbMATH DE number 3783030 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 554482 (Why is no real title available?)
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- Flip-flop nets
- PETRI NETS AND STEP TRANSITION SYSTEMS
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Polynomial algorithms for the synthesis of bounded nets
- Some complexity results on transition systems and elementary net systems
- The synthesis problem of Petri nets
Cited in
(34)- Real time identification of discrete event systems using Petri nets
- The Complexity of Synthesis of b-Bounded Petri Nets
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
- Discovery, Verification and Conformance of Workflows with Cancellation
- Articulation of Transition Systems and Its Application to Petri Net Synthesis
- Hardness Results for the Synthesis of b-bounded Petri Nets
- Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
- Topics in region theory and synthesis problems
- 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
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- Step semantics of Boolean nets
- Synthesis of (choice-free) reset nets
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- Elementary net synthesis remains NP-complete even for extremely simple inputs
- Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets
- Synthesising elementary net systems with localities
- Lectures on Concurrency and Petri Nets
- Stratified petri nets
- Narrowing down the hardness barrier of synthesizing elementary net systems
- Flip-flop nets
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
- The complexity of synthesizing elementary net systems relative to natural parameters
- Applying regions
- Regions of Petri nets with a/sync connections
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
- Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
- Bounded choice-free Petri net synthesis: algorithmic issues
- Target-oriented Petri net synthesis
- Synthesis and reengineering of persistent systems
- The power of prime cycles
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
- \(k\)-bounded Petri net synthesis from modal transition systems
This page was built for publication: The synthesis problem for elementary net systems is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389765)
