Skip to main content
Conference Proceedings

The reachability problem for vector addition system with one zero-test

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6907 LNCS 145-157
DOI: 10.1007/978-3-642-22993-0_16
21Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider here a variation of Vector Addition Systems where one counter can be tested for zero, extending the reachability proof by Leroux for Vector Addition System to our model. This provides an alternate, and hopefully simpler to understand, proof of the reachability problem that was originally proved by Reinhardt. © 2011 Springer-Verlag GmbH.

Cite

CITATION STYLE

APA

Bonnet, R. (2011). The reachability problem for vector addition system with one zero-test. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6907 LNCS, pp. 145–157). https://doi.org/10.1007/978-3-642-22993-0_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free