Abstract
The main result of this paper is a proof that the reachability set (post *) of any 2-dim Reset/Transfer Vector Addition System with States is an effectively computable semilinear set. Our result implies that numerous boundedness and reachability properties are decidable for this class. Since the traditional Karp and Miller’s algorithm does not terminate when applied to 2-dim Reset/Transfer VASS, we introduce, as a tool for the proof, a new technique to construct a finite coverability tree for this class.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Proc. 16th Ann. Symp. Theoretical Aspects of Computer Science (STACS’99), Trier, Germany, Mar. 1999, volume 1563 of Lecture Notes in Computer Science, pages 323–333. Springer, 1999.
C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset nets between decidability and undecidability. In Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP’98), Aalborg, Denmark, July 1998, volume 1443 of Lecture Notes in Computer Science, pages 103–115. Springer, 1998.
C. Dufourd, P. Jančar, and Ph. Schnoebelen. Boundedness of Reset P/T nets. In Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP’99), Prague, Czech Republic, July 1999, volume 1644 of Lecture Notes in Computer Science, pages 301–310. Springer, 1999.
A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144–179, 1990.
A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. In Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS’2000), Lille, France, Feb. 2000, volume 1770 of Lecture Notes in Computer Science, pages 346–357. Springer, 2000.
A. Finkel and G. Sutre. Verification of two counters automata. Research Report LSV-2000-7, Lab. Specification and Verification, ENS de Cachan, Cachan, France, June 2000.
J. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8:135–159, 1979.
S. R. Kosaraju. Decidability of reachability in vector addition systems. In Proc. 14th ACM Symp. Theory of Computing (STOC’82), San Francisco, CA, May 1982, pages 267–281, 1982.
E. W. Mayr. An algorithm for the general Petri net reachability problem. SIAM J. Comput., 13(3):441–460, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finkel, A., Sutre, G. (2000). An Algorithm Constructing the Semilinear Post for 2-Dim Reset/Transfer VASS. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_31
Download citation
DOI: https://doi.org/10.1007/3-540-44612-5_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67901-1
Online ISBN: 978-3-540-44612-5
eBook Packages: Springer Book Archive