Pages that link to "Item:Q809611"

The following pages link to A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611):

Displaying 2 items.

• A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming (Q1197993) (← links)
• Deciding a class of path formulas for conflict-free Petri nets (Q1364130) (← links)