Abstract
We generalize the traditional definition of a multicounter machine (where the counters, which can only assume nonnegative integer values, can be incremented/decremented by 1 and tested for zero) by allowing the machine the additional ability to increment/decrement each counter C i by a nondeterministically chosen fractional amount δ i between 0 and 1 (δ i may be different at each step). Further at each step, the δ i ’s of some counters can be linearly related in that they can be integral multiples of the same fractional δ (e.g., δ i = 3δ, δ3 = 6δ). We show that, under some restrictions on counter behavior, the binary reachability set of such a machine is definable in the additive theory of the reals and integers. There are applications of this result in verification, and we give an example in the paper. We also extend the notion of “semilinear language” to “dense semilinear language” and show its connection to a restricted class of dense multicounter automata.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alur, R., Courcoubetis, C., Henzinger, T.A.: Computing accumulated delays in realtime systems. Formal Methods in System Design: An International Journal 11(2), 137–155 (1997)
Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Hybrid Systems, pp. 209–229 (1992)
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Boigelot, B., Rassart, S., Wolper, P.: On the expressiveness of real and integer arithmetic automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 152–163. Springer, Heidelberg (1998)
Boigelot, B., Wolper, P.: Symbolic verification with periodic sets. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 55–67. Springer, Heidelberg (1994)
Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and Presburger arithmetic. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 268–279. Springer, Heidelberg (1998)
Comon, H., Jurski, Y.: Timed automata and the theory of real numbers. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 242–257. Springer, Heidelberg (1999)
Dang, Z., Ibarra, O.H., Sun, Z.: On the emptiness problems for two-way nondeterministic finite automata with one reversal-bounded counter. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 103–114. Springer, Heidelberg (2002)
Dang, Z., Ibarra, O.H., Bultan, T., Kemmerer, R.A., Su, J.: Binary reachability analysis of discrete pushdown timed automata. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 69–84. Springer, Heidelberg (2000)
Dang, Z., Ibarra, O.H.: On the existence of ω-chains for transitive mixed linear relations and its applications. International Journal of Foundations of Computer Science 13(6), 911–936 (2002)
Dang, Z., San Pietro, P., Kemmerer, R.A.: On Presburger Liveness of Discrete Timed Automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 132–143. Springer, Heidelberg (2001)
Fribourg, L., Olsen, H.: A decompositional approach for computing least fixed-points of Datalog programs with Z-counters. Constraints 2(3/4), 305–335 (1997)
Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HYTECH: A ModelChecker for Hybrid Systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 460–463. Springer, Heidelberg (1997)
Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25(1), 116–133 (1978)
Ibarra, O.H., Jiang, T., Tran, N., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Comput. 24, 123–137 (1995)
Larsen, K., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 493–505. Springer, Heidelberg (2001)
Minsky, M.: Recursive unsolvability of Post’s problem of Tag and other topics in the theory of Turing machines. Ann. of Math. 74, 437–455 (1961)
Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: An approach to the description and analysis of hybrid systems. In: Hybrid Systems, pp. 149–178 (1992)
Puri, A., Kopke, P., Henzinger, T., Varaiya, P.: What’s decidable about hybrid automata? In: 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 372–382 (1995)
Revesz, P.Z.: A closed form for datalog queries with integer order. In: Kanellakis, P.C., Abiteboul, S. (eds.) ICDT 1990. LNCS, vol. 470, pp. 187–201. Springer, Heidelberg (1990)
Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: Proc. Intl. Symp. On Symbolic and Algebraic Computation, Vancouver, B.C., Canada, July 29-31, pp. 129–136 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, G., Dang, Z., Ibarra, O.H., Pietro, P.S. (2003). Dense Counter Machines and Verification Problems. In: Hunt, W.A., Somenzi, F. (eds) Computer Aided Verification. CAV 2003. Lecture Notes in Computer Science, vol 2725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45069-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-45069-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40524-5
Online ISBN: 978-3-540-45069-6
eBook Packages: Springer Book Archive