Pages that link to "Item:Q2327509"

The following pages link to The complexity of synthesis for 43 Boolean Petri net types (Q2327509):

Displaying 3 items.

• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
• The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629) (← links)
• The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)