The reachability problem for Petri nets is not primitive recursive
From MaRDI portal
Cited in
(38)- Orbit-finite linear programming
- Invariants for one-counter automata with disequality tests
- Verification of population protocols with unordered data
- Flattability of priority vector addition systems
- Improved algorithm for reachability in d-VASS
- Structural liveness of conservative Petri nets
- Temporal hyperproperties for population protocols
- Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality
- Reachability in restricted chemical reaction networks
- Automatic WSTS-based repair and deadlock detection of parameterized systems
- Counter machines with infrequent reversals
- New lower bounds for reachability in vector addition systems
- Acyclic Petri and workflow nets with resets
- Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
- The semilinear home-space problem is Ackermann-complete for Petri nets
- History-deterministic vector addition systems
- Monus semantics in vector addition systems with states
- Safety analysis of parameterised networks with non-blocking rendez-vous
- Geometry of reachability sets of vector addition systems
- On the separability problem of VASS reachability languages
- Soundness of reset workflow nets
- Decidability and complexity of decision problems for affine continuous vass
- The geometry of reachability in continuous vector addition systems with states
- Language inclusion for boundedly-ambiguous vector addition systems is decidable
- Rate-independent computation in continuous chemical reaction networks
- On the home-space problem for Petri nets and its Ackermannian complexity
- Challenges of the reachability problem in infinite-state systems (invited paper)
- Two-way one-counter nets revisited
- Box-reachability in vector addition systems
- On the reachability problem for two-dimensional branching VASS
- Regular model checking for systems with effectively regular reachability relation
- Wait-only broadcast protocols are easier to verify
- Reachability in symmetric VASS
- Reachability in vector addition system with states parameterized by geometric dimension
- Bridging the gap between plain VASS and branching VASS
- Polynomial simulations of CRN models with trimolecular void step-cycle CRNs
- A note on the parameterised complexity of coverability in vector addition systems
- Polynomial equivalence of extended chemical reaction models
This page was built for publication: The reachability problem for Petri nets is not primitive recursive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943428)
