Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Polynomial-Time Manz-One Reductions for Petri Nets
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
PETRI NET LANGUAGE
Computation: finite and infinite machines
Computation: finite and infinite machines
Reversal-Bounded Counter Machines Revisited
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Reachability in Petri Nets with Inhibitor Arcs
Electronic Notes in Theoretical Computer Science (ENTCS)
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Parallel program schemata: A mathematical model for parallel computation
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
The reachability problem for vector addition system with one zero-test
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Decidability of LTL for vector addition systems with one zero-test
RP'11 Proceedings of the 5th international conference on Reachability problems
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
On selective unboundedness of VASS
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has been proved that the reachability problem is decidable. We prove here that boundedness, termination and reversal-boundedness are decidable for VASS with one zero-test. To decide reversal-boundedness, we provide an original method which mixes both the construction of the coverability graph for VASS and the computation of the reachability set of reversal-bounded counter machines. The same construction can be slightly adapted to decide boundedness and hence termination.