Pages that link to "Item:Q1346631"

The following pages link to Some complexity results on transition systems and elementary net systems (Q1346631):

Displaying 5 items.

• The synthesis problem for elementary net systems is NP-complete (Q1389765) (← links)
• The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629) (← links)
• (Q5009430) (← links)
• The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
• Polynomial algorithms for the synthesis of bounded nets (Q5096743) (← links)