A multiparameter analysis of the boundedness problem for vector addition systems
Journal of Computer and System Sciences
The complexity of almost linear diophantine problems
Journal of Symbolic Computation
A unified approach for deciding the existence of certain Petri net paths
Information and Computation
On the Complexity of the Linear-Time mu -calculus for Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Reversal-Bounded Counter Machines Revisited
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Verifying liveness for asynchronous programs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of Computer and System Sciences
Vector addition system reachability problem: a short self-contained proof
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Dynamic cutoff detection in parameterized concurrent programs
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
On selective unboundedness of VASS
Journal of Computer and System Sciences
A relational trace logic for vector addition systems with application to context-freeness
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
On the Context-Freeness Problem for Vector Addition Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
A large number of properties of a vector addition system-- for instance coverability, boundedness, or regularity--can be decided using its coverability graph, by looking for some characteristic pattern. We propose to unify the known exponential-space upper bounds on the complexity of such problems on vector addition systems, by seeing them as instances of the model-checking problem for a suitable extension of computation tree logic, which allows to check for the existence of these patterns. This provides new insights into what constitutes a "coverabilitylike" property.