The following pages link to On weak persistency of Petri nets (Q1158764):
Displaying 15 items.
- On conditions for the liveness of weakly persistent nets (Q989543) (← links)
- A decomposition theorem for finite persistent transition systems (Q1015394) (← links)
- Normal Petri nets (Q1057065) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- A unified approach for deciding the existence of certain petri net paths (Q1184737) (← links)
- On structural conditions for weak persistency and semilinearity of Petri nets (Q1186602) (← links)
- Learning semilinear sets from examples and via queries (Q1200804) (← links)
- On the teaching complexity of linear sets (Q1704564) (← links)
- Minimal output unstable configurations in chemical reaction networks and deciders (Q2311221) (← links)
- Petri Nets and Semilinear Sets (Extended Abstract) (Q3179388) (← links)
- (Q3327735) (← links)
- PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS (Q3395130) (← links)
- Decomposition Theorems for Bounded Persistent Petri Nets (Q3510855) (← links)
- Reduced state space representation for unbounded vector state spaces (Q4633164) (← links)