Abstract
We present a global and comprehensive view of the properties of subclasses of two counters automata for which counters are only accessed through the following operations: increment (+1), decrement (−1), reset (c := 0), transfer (the whole content of counter c is transfered into counter c′), and testing for zero. We first extend Hopcroft-Pansiot’s result (an algorithm for computing a finite description of the semilinear set post*) to two counters automata with only one test for zero (and one reset and one transfer operations). Then, we prove the semilinearity and the computability of pre* for the subclass of 2 counters automata with one test for zero on c1, two reset operations and one transfer from c1 to c2. By proving simulations between subclasses, we show that this subclass is the maximal class for which pre* is semilinear and effectively computable. All the (effective) semilinearity results are obtained with the help of a new symbolic reachability tree algorithm for counter automata using an Acceleration function. When Acceleration has the so-called stability property, the constructed tree computes exactly the reachability set.
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, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. 8th Int. Conf. Concurrency Theory (CONCUR’97), Warsaw, Poland, Jul. 1997, volume 1243 of Lecture Notes in Computer Science, pages 135–150. Springer, 1997.
M. Benois and J. Sakarovitch. On the complexity of some extended word problems defined by cancellation rules. Information Processing Letters, 23(6):281–287, 1986.
D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61–86, 1992.
G. Cécé and A. Finkel. Programs with quasi-stable channels are effectively recognizable. In Proc. of the 9th Conference on Computer-Aided Verification (CAV), volume 1254, pages 304–315. LNCS, June 1997.
G. Cécé, A. Finkel, and I. S. Purushothaman. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20–31, 1996.
H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In Proc. 10th Int. Conf. Computer Aided Verification (CAV’98), Vancouver, BC, Canada, June–July 1998, volume 1427 of Lecture Notes in Computer Science, pages 268–279. Springer, 1998.
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.
C. Dufourd. Réseaux de Petri avec reset/transfert: Décidabilité et indécidabilité. Thèse de Docteur en Sciences de l’École Normale Supérieure de Cachan, October 1998.
A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science, 9, 1997.
J. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8:135–159, 1979.
R. R. Howell, L. E. Rosier, D. T. Huynh, and H-C. Yen. Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states. Theoretical Computer Science, 46:107–140, 1986.
R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3(2):147–195, 1969.
K. Reinhardt. Reachability in Petri nets with inhibitor arcs, November 1995. Unpublished manuscript. See http://www-fs.informatik.uni-tuebingen.de/~reinhard.
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). Decidability of Reachability Problems for Classes of Two Counters Automata. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_29
Download citation
DOI: https://doi.org/10.1007/3-540-46541-3_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67141-1
Online ISBN: 978-3-540-46541-6
eBook Packages: Springer Book Archive