The following pages link to Flip-flop nets (Q4593957):
Displaying 12 items.
- Regions of Petri nets with a/sync connections (Q714824) (← links)
- Applying regions (Q728281) (← links)
- The synthesis problem for elementary net systems is NP-complete (Q1389765) (← links)
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629) (← links)
- Step semantics of Boolean nets (Q2376982) (← links)
- Synthesis of Petri Nets with Whole-Place Operations and Localities (Q3179395) (← links)
- (Q5009430) (← 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)
