Skip to main content
SpringerLink
Log in

Real-Counter Automata and Their Decision Problems

(Extended Abstract)

  • Conference paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3328))

Abstract

We introduce real-counter automata, which are two-way finite automata augmented with counters that take real values. In contrast to traditional word automata that accept sequences of symbols, real-counter automata accept real words that are bounded and closed real intervals delimited by a finite number of markers. We study the membership and emptiness problems for one-way/two-way real-counter automata as well as those automata further augmented with other unbounded storage devices such as integer-counters and pushdown stacks.

The research of Zhe Dang and Gaoyan Xie was supported in part by NSF Grant CCF-0430531. The research of Oscar H. Ibarra has been supported in part by by NSF Grants IIS-0101134, CCR-0208595, and CCF-0430945. The research of Pierluigi San Pietro has been supported in part by MIUR grants FIRB RBAU01MCAC, COFIN 2003012437-004.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 209–229. Springer, Heidelberg (1993)

    Google Scholar 

  2. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alur, R., Henzinger, T.A.: Back to the future: Towards a theory of timed regular languages. In: Proceedings of FOCS 1992. IEEE press, Los Alamitos (1992)

    Google Scholar 

  4. Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM 49(2), 172–206

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Bouyer, P., Petit, A., Therien, D.: An algebraic characterization of data and timed languages. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 248–261. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8(2), 244–263 (1986)

    Article  MATH  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Dang, Z.: Pushdown time automata: a binary reachability characterization and safety verification. Theoretical Computer Science 302, 93–121 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dang, Z., Ibarra, O.H., Bultan, T., Kemmerer, R.A., Su, J.: Binary reachability analysis of discrete pushdown timed automata. In: CAV 2000. LNCS, vol. 1855, pp. 69–84. Springer, Heidelberg (2000)

    Google Scholar 

  11. Dang, Z., Ibarra, O.H., Kemmerer, R.A.: Generalized discrete timed automata: decidable approximations for safety verification. Theoretical Computer Science 296, 59–74 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Dang, Z., Ibarra, O.H., San Pietro, P.: Liveness Verification of Reversal-bounded Multicounter Machines with a Free Counter. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 132–143. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Dang, Z., Ibarra, O.H., Sun, Z.: On the emptiness problem for two-way NFA with one reversal-bounded counter. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 103–114. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Dang, Z., San Pietro, P., Kemmerer, R.A.: Presburger liveness verification for discrete timed automata. Theoretical Computer Science 299, 413–438 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. 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)

    Article  MATH  MathSciNet  Google Scholar 

  16. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HyTech: A Model Checker for Hybrid Systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 460–463. Springer, Heidelberg (1997)

    Google Scholar 

  17. Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25(1), 116–133 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ibarra, O.H., Jiang, T., Tran, N., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Comput. 24, 123–137 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  19. Keste, Y., Pnueli, A., Sifakis, J., Yovine, S.: Integration graphs: A class of decidable hybrid systems. In: Workshop on Theory of Hybrid Systems. LNCS, vol. 736, pp. 179–208. Springer, Heidelberg (1992)

    Google Scholar 

  20. 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)

    Article  MathSciNet  Google Scholar 

  21. Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: An approach to the description and analysis of hybrid systems. In: Hybrid Systems. LNCS, vol. 736, pp. 149–178. Springer, Heidelberg (1992)

    Google Scholar 

  22. Puri, A., Kopke, P., Henzinger, T., Varaiya, P.: What’s decidable about hybrid automata? In: 27th Annual ACM Symposium on Theory of Computing STOC 1995, pp. 372–382 (1995)

    Google Scholar 

  23. Parikh, R.: On context-free languages. Journal of the ACM 13, 570–581 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  24. San Pietro, P., Dang, Z.: Automatic verification of multi-queue discrete timed automata. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 159–171. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. 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)

    Google Scholar 

  26. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings 1st Annual IEEESymp.on Logic in Computer Science, LICS 1986, Cambridge,MA,USA, June 16–18, pp. 332–344. IEEE Computer Society Press, Washington, DC (1986)

    Google Scholar 

  27. 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)

    Google Scholar 

  28. Xie, G., Dang, Z., Ibarra, O.H., San Pietro, P.: Dense counter machines and verification problems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 163–175. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, 99164, USA

    Zhe Dang & Gaoyan Xie

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

  3. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italia

    Pierluigi San Pietro

Authors
  1. Zhe Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pierluigi San Pietro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gaoyan Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Sciences, CIT Campus, P.O. Box, 600113, Chennai, India

    Kamal Lodaya

  2. The Institute of Mathematical Sciences, 600 113, Chennai, India

    Meena Mahajan

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dang, Z., Ibarra, O.H., Pietro, P.S., Xie, G. (2004). Real-Counter Automata and Their Decision Problems. In: Lodaya, K., Mahajan, M. (eds) FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2004. Lecture Notes in Computer Science, vol 3328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30538-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30538-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24058-7

  • Online ISBN: 978-3-540-30538-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation