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 4 items.
- 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)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)
