Pages that link to "Item:Q1389765"
From MaRDI portal
The following pages link to The synthesis problem for elementary net systems is NP-complete (Q1389765):
Displaying 25 items.
- Regions of Petri nets with a/sync connections (Q714824) (← links)
- Applying regions (Q728281) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839) (← links)
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
- Synthesising elementary net systems with localities (Q2077411) (← links)
- Topics in region theory and synthesis problems (Q2117149) (← links)
- Synthesis of (choice-free) reset nets (Q2117175) (← links)
- Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- Synthesis and reengineering of persistent systems (Q2257983) (← links)
- The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629) (← links)
- Step semantics of Boolean nets (Q2376982) (← links)
- Real time identification of discrete event systems using Petri nets (Q2440714) (← links)
- The Power of Prime Cycles (Q2822651) (← links)
- Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems (Q3297771) (← links)
- Discovery, Verification and Conformance of Workflows with Cancellation (Q3540385) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- (Q5009430) (← links)
- (Q5019696) (← links)
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis (Q5025057) (← links)
- The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)
- k-Bounded Petri Net Synthesis from Modal Transition Systems. (Q5111618) (← links)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)
