Pages that link to "Item:Q1144929"
From MaRDI portal
The following pages link to The decidability of persistence for vector addition systems (Q1144929):
Displaying 12 items.
- A decomposition theorem for finite persistent transition systems (Q1015394) (← links)
- Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (Q1041759) (← links)
- Normal Petri nets (Q1057065) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- On weak persistency of Petri nets (Q1158764) (← links)
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- Deciding a class of path formulas for conflict-free Petri nets (Q1364130) (← links)
- PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS (Q3395130) (← links)
- Decomposition Theorems for Bounded Persistent Petri Nets (Q3510855) (← links)
