Pages that link to "Item:Q1097037"
From MaRDI portal
The following pages link to An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems (Q1097037):
Displaying 9 items.
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming (Q1197993) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- Deciding a class of path formulas for conflict-free Petri nets (Q1364130) (← links)
- Bounded self-stabilizing Petri nets (Q1892714) (← links)
