Skip to main content
Springer Nature Link
Log in

Safety Verification for Two-Way Finite Automata with Monotonic Counters

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

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

Included in the following conference series:

  • 349 Accesses

Abstract

We look at a model of a two-way nondeterministic finite automaton augmented with monotonic counters operating on inputs of the form \( a_1^{i_1 } ...a_n^{i_n } \) for some fixed n and distinct symbols a 1,…, a n, where i 1,…, i n are nonnegative integers. Our results concern the following Presburger safety verification problem: Given a machine M, a state q, and a Presburger relation E over counter values, is there (i 1,…, i n ) such that M, when started in its initial state on the left end of the input \( a_1^{i_1 } ...a_n^{i_n } \) with all counters initially zero, reaches some configuration where the state is q and the counter values satisfy E? We give positive and negative results for different variations and generalizations of the model (e.g., augmenting the model with reversal-bounded counters, discrete clocks, etc.). In particular, we settle an open problem in [10]

The work by Oscar H. Ibarra has been supported in part by NSF Grants IIS-0101134 and CCR02-08595.

Corresponding author (ibarra@cs.ucsb.edu).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–235, April 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Alur, T. A. Henzinger, and M. Y. Vardi. Parametric real-time reasoning. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 592–601, San Diego, California, 16-18 May 1993.

    Google Scholar 

  3. A. Bouajjani, R. Echahed, and R. Robbana. On the automatic verification of systems with continuous variables and unbounded discrete data structures. In Hybrid Systems II, volume 999 of Lecture Notes in Computer Science. Springer-Verlag, 1995.

    Google Scholar 

  4. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: application to model-checking. In Concurrency (CONCUR 1997), volume 1243 of Lecture Notes in Computer Science, pages 135–150. Springer-Verlag, 1997.

    Google Scholar 

  5. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop of Logic of Programs, volume 131 of Lecture Notes in Computer Science. Springer, 1981.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  7. Z. Dang. Phd. dissertation. Department of Computer Science, University of California at Santa Barbara, 2000.

    Google Scholar 

  8. Z. Dang, O. Ibarra, and Z. Sun. On the emptiness problems for two-way nondeterministic finite automata with one reversal-bounded counter. Submitted, 2002.

    Google Scholar 

  9. Zhe Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer, and J. Su. Binary reachability analysis of discrete pushdown timed automata. In Proceedings of the International Conference on Computer Aided Verification (CAV’00), volume 1855 of Lecture Notes in Computer Science, pages 69–84. Springer, 2000.

    Google Scholar 

  10. Zhe Dang, O. H. Ibarra, and R. A. Kemmerer. Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. In Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON’01), volume 2108 of Lecture Notes in Computer Science, pages 529–539. Springer, 2001.

    Google Scholar 

  11. Zhe Dang and R. A. Kemmerer. A symbolic model-checker for testing ASTRAL real-time specifications. In Proceedings of the Sixth International Conference on Real-time Computing Systems and Applications, pages 131–142. IEEE Computer Society Press, 1999.

    Google Scholar 

  12. Zhe Dang and R. A. Kemmerer. Using the ASTRAL Model Checker to Analyze Mobile IP. In Proceedings of the 1999 International Conference on Software Engineering (ICSE’99), pages 132–141. IEEE Computer Society Press / ACM Press, 1999.

    Google Scholar 

  13. Zhe Dang and R. A. Kemmerer. Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems. In Proceedings of the 2000 International Conference on Software Engineering (ICSE’00), pages 345–354. IEEE Computer Society Press, 2000.

    Google Scholar 

  14. S. Ginsburg and E. Spanier. Semigroups, presburger formulas, and languages. Pacific J. of Mathematics, 16:285–296, 1966.

    MATH  MathSciNet  Google Scholar 

  15. E. M. Gurari and O. H. Ibarra. The complexity of decision problems for finite-turn multicounter machines. Journal of Computer and System Sciences, 22:220–229, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  16. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279–295, May 1997. Special Issue: Formal Methods in Software Practice.

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  19. O. H. Ibarra, J. Su, Zhe Dang, T. Bultan, and R. A. Kemmerer. Counter machines: decidable properties and applications to verification problems. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), volume 1893 of Lecture Notes in Computer Science, pages 426–435. Springer-Verlag, 2000.

    Google Scholar 

  20. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.

    MATH  Google Scholar 

  21. 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.

    Article  MathSciNet  Google Scholar 

  22. A. P. Sistla and E. M. Clarke. Complexity of propositional temporal logics. Journal of ACM, 32(3):733–749, 1983.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Oscar H. Ibarra

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

    Zhe Dang

  3. Department of Mathematics, Nanjing University, 210093, Nanjing, China

    Zhi-Wei Sun

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhe Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhi-Wei Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ibarra, O.H., Dang, Z., Sun, ZW. (2003). Safety Verification for Two-Way Finite Automata with Monotonic Counters. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

  • Online ISBN: 978-3-540-45005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics