Pages that link to "Item:Q620942"
From MaRDI portal
The following pages link to Linear time analysis of properties of conflict-free and general Petri nets (Q620942):
Displaying 9 items.
- The formalization of decision-free Petri net (Q467809) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611) (← links)
- Priority conflict-free Petri nets (Q1127822) (← 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)
- Lower and upper bounds of shortest paths in reachability graphs (Q1777827) (← links)
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws (Q2325088) (← links)
- Static analysis of biological regulatory networks dynamics using abstract interpretation (Q2909733) (← links)