Pages that link to "Item:Q2032841"
From MaRDI portal
The following pages link to The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841):
Displaying 7 items.
- 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)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- (Q5019696) (← 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)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)
