A note on the parameterised complexity of coverability in vector addition systems
From MaRDI portal
Cites work
- A multiparameter analysis of the boundedness problem for vector addition systems
- An SMT-based approach to coverability analysis
- Approaching the coverability problem continuously
- Complexity analysis of the backward coverability algorithm for VASS
- Complexity hierarchies beyond elementary
- Component reconfiguration in the presence of conflicts
- Coverability in VASS revisited: improving Rackoff's bound to obtain conditional optimality
- History-register automata
- Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
- Occam's razor applied to the Petri net coverability problem
- On the length of strongly monotone descending chains over \(\mathbb{N}^d\)
- On the reachability problem for 5-dimensional vector addition systems
- Ordered navigation on multi-attributed data words
- Parallel program schemata
- Parameterized complexity and approximability of coverability problems in weighted Petri nets
- Parametrized complexity theory.
- Petri nets for modelling metabolic pathways: a survey
- Reachability in fixed VASS: expressiveness and lower bounds
- Reachability in two-clock timed automata is PSPACE-complete
- Reachability in two-dimensional vector addition systems with states is PSPACE-complete
- Reachability in vector addition systems is Ackermann-complete
- Reachability in vector addition systems is primitive-recursive in fixed dimension
- Resolution of Hartmanis' conjecture for NL-hard sparse sets
- Small vertex cover makes Petri net coverability and boundedness easier
- Some complexity results for stateful network verification
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
- The covering and boundedness problems for vector addition systems
- The ideal view on Rackoff's coverability technique
- The reachability problem for Petri nets is not primitive recursive
This page was built for publication: A note on the parameterised complexity of coverability in vector addition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356350)
