Pages that link to "Item:Q1364130"
From MaRDI portal
The following pages link to Deciding a class of path formulas for conflict-free Petri nets (Q1364130):
Displaying 7 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)
- A unified approach for deciding the existence of certain petri net paths (Q1184737) (← links)
- A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming (Q1197993) (← links)
- A valuation-based analysis of conflict-free Petri nets (Q1605406) (← links)
- Separability in Conflict-Free Petri Nets (Q3401931) (← links)
- (Q3642015) (← links)