Abstract
We study various generalizations of reversal-bounded multicounter machines and show that they have decidable emptiness, infiniteness, disjointness, containment, and equivalence problems. The extensions include allowing the machines to perform linear-relation tests among the counters and parameterized constants (e.g., “Is 3x -5y -2D 1+9D2 < 12”, where x, y are counters, and D 1+D 2 are parameterized constants). We believe that these machines are the most powerful machines known to date for which these decision problems are decidable. Decidability results for such machines are useful in the analysis of reachability problems and the verification/debugging of safety properties in infinite-state transition systems. For example, we show that (binary, forward, and backward) reachability, safety, and invariance are solvable for these machines.
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
R. Alur and D. Dill. “A theory of timed automata,” Theo. Comp. Sci., 126(2):183–235, 1994.
B. Baker and R. Book. “Reversal-bounded multipushdown machines,” J.C.S.S., 8:315–332, 1974.
H. Comon and Y. Jurski. “Multiple counters automata, safety analysis and Presburger arithmetic,” Proc. Int. Conf. on Computer Aided Verification, pp. 268–279, 1998.
Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer, and J. Su. “Decidable approximations on discrete clock machines with parameterized durations,” in preparation.
Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer, and J. Su. “Binary reachability analysis of discrete pushdown timed automata,” to appear in CAV 2000.
Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer, and J. Su. “Past machines,” in preparation.
J. Esparza. “Decidability of model checking for infinite-state concurrent systems,” Acta Informatica. 34(2):85–107, 1997.
E. M. Gurari and O. H. Ibarra. “Simple counter machines and number-theoretic problems,” J.C.S.S., 19:145–162, 1979.
O. H. Ibarra. “Reversal-bounded multicounter machines and their decision problems,” J. ACM, 25:116–133, 1978.
O. H. Ibarra, T. Jiang, N. Tran, and H. Wang. “New decidability results concerning two-way counter machines,” SIAM J. Comput., 24(1):123–137, 1995.
Y. Matijasevic. “Enumerable sets are Diophantine,” Soviet Math. Dokl, 11:354–357, 1970.
M. Minsky. “Recursive unsolvability of Post’s problem of Tag and other topics in the theory of Turing machines.” Ann. of Math., 74:437–455, 1961.
R. Parikh. “On context-free languages,” J. ACM, 13:570–581, 1966.
L. G. Valiant and M. S. Paterson. “Deterministic one-counter automata,” J. C.S.S., 10:340–350, 1975.
P. Wolper and B. Boigelot. “Verifying systems with infinite but regular state spaces,” Proc. 10th Int. Conf. on Computer Aided Verification, pp. 88–97, 1998.
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
Ibarra, O.H., Su, J., Dang, Z., Bultan, T., Kemmerer, R. (2000). Counter Machines: Decidable Properties and Applications to Verification Problems. 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_38
Download citation
DOI: https://doi.org/10.1007/3-540-44612-5_38
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