Pages that link to "Item:Q5025061"
From MaRDI portal
The following pages link to The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061):
Displaying 10 items.
- Over-approximative Petri net synthesis for restricted subclasses of nets (Q1647718) (← links)
- Bounded self-stabilizing Petri nets (Q1892714) (← links)
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
- Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues (Q2165238) (← links)
- The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629) (← links)
- The Complexity of Bounded Synthesis for Timed Control with Partial Observability (Q4649397) (← links)
- Narrowing down the hardness barrier of synthesizing elementary net systems (Q5009430) (← links)
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency (Q5019696) (← links)
- Lectures on Concurrency and Petri Nets (Q5712276) (← links)