scientific article; zbMATH DE number 7407775
From MaRDI portal
Publication:5155664
Recommendations
- The complexity of reachability in affine vector addition systems with states
- scientific article; zbMATH DE number 4035164
- scientific article; zbMATH DE number 7559504
- The Reachability Problem for Two-Dimensional Vector Addition Systems with States
- scientific article; zbMATH DE number 3878366
- scientific article; zbMATH DE number 4092784
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- The polynomial complexity of vector addition systems with states
- Demystifying Reachability in Vector Addition Systems
- Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
Cites work
- A structure to decide reachability in Petri nets
- Affine extensions of integer vector addition systems with states
- Affine Parikh automata
- Complexity analysis of continuous Petri nets
- Context-free commutative grammars with integer counters and resets
- Demystifying Reachability in Vector Addition Systems
- DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES
- Extending the Rackoff technique to affine nets
- How hard is it to verify flat affine counter systems with the finite monoid property?
- scientific article; zbMATH DE number 3646295 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 2080048 (Why is no real title available?)
- Integer vector addition systems with states
- Logics for continuous reachability in Petri nets and vector addition systems with states
- Reasoning about systems with many processes
- Some decision problems related to the reachability problem for Petri nets
- The general vector addition system reachability problem by Presburger inductive invariants
- The logical view on continuous Petri nets
- Unbounded-thread program verification using thread-state equations
- Vector addition system reachability problem, a short self-contained proof
- Verification of population protocols
Cited in
(11)- Model Checking Coverability Graphs of Vector Addition Systems
- Hyper-Ackermannian bounds for pushdown vector addition systems
- Demystifying Reachability in Vector Addition Systems
- The Reachability Problem for Two-Dimensional Vector Addition Systems with States
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
- Affine extensions of integer vector addition systems with states
- Long-Run Average Behavior of Vector Addition Systems with States
- On simulating Turing machines with matrix semigroups with integrality tests
- Acyclic Petri and workflow nets with resets
- Decidability and complexity of decision problems for affine continuous vass
- Regular model checking for systems with effectively regular reachability relation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155664)
