Skip to main content
SpringerLink
Log in

Some Perspectives of Infinite-State Verification

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3707))

Abstract

We report on recent progress in the study of infinite transition systems for which interesting properties (like reachability of designated states) can be checked algorithmically. Two methods for the generation of such models are discussed: the construction from simpler models via operations like unfolding and synchronized product, and the internal representation of state spaces by regular sets of words or trees.

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. Berwanger, D., Blumensath, A.: The monadic theory of tree-like structures. In: [12], pp. 285–302

    Google Scholar 

  2. Blumensath, A., Grädel, E.: Automatic structures. In: Proc. 15th LICS, pp. 51–62. IEEE Comput. Soc. Press, Los Alamitos (2000)

    Google Scholar 

  3. Büchi, J.R.: Regular canonical systems. Z. Math. Logik Grundl. Math. 6, 91–111 (1964)

    MATH  Google Scholar 

  4. Caucal, D.: On infinite terms having a decidable theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 165–176. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290, 79–115 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Colcombet, T.: On families of graphs having a decidable first order theory with reachability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 98–109. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Courcelle, B.: Monadic second-order graph transductions: a survey. Theor. Comput. Sci. 126, 53–75 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Courcelle, B., Walukiewicz, I.: Monadic second-order logic, graph coverings and unfoldings of transition systems. Ann. Pure Appl. Logic 92, 51–65 (1998)

    Article  MathSciNet  Google Scholar 

  9. Carayol, A., Wöhrle, S.: The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 112–123. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Damm, W., Goerdt, A.: An automata theoretical characterization of the OI-hierarchy. Inf. Contr. 71, 1–32 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  11. Feferman, S., Vaught, R.: The first-order properties of products of algebraic systems. Fund. Math. 47, 57–103 (1959)

    MATH  MathSciNet  Google Scholar 

  12. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  13. Karianto, W.: Adding monotonic counters to automata and transition graphs. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 308–319. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Knapik, T., Niwinski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 205–222. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Leucker, M.: Prefix recognizable graphs and monadic logic. In: [12], 263–284

    Google Scholar 

  16. Löding, C.: Infinite Graphs Generated by Tree Rewriting, Dissertation, RWTH Aachen 2002 (2002)

    Google Scholar 

  17. Löding, C.: Reachability problems on regular ground-tree rewriting graphs. Theory of Computing Systems (to appear)

    Google Scholar 

  18. Muller, D., Schupp, P.: The theory of ends, pushdown automata, and second-order logic. Theor. Comput. Sci. 37, 51–75 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  19. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  20. Rabinovich, A.: On compositionality and its limitations. ACM Trans. on Computational Logic (to appear)

    Google Scholar 

  21. Thomas, W.: Automata on infinite objects. In: Leeuwen, J.V. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 133–191. Elsevier, Amsterdam (1990)

    Google Scholar 

  22. Thomas, W.: A short introduction to infinite automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 130–144. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  23. Thomas, W.: Constructing infinite graphs with a decidable MSO-theory. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 113–124. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  24. Walukiewicz, I.: Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275, 311–346 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  25. Wöhrle, S.: Decision Problems over Infinite Graphs: Higher-Order Pushdown Systems and Synchronized Products, Dissertation, RWTH Aachen 2005 (2005)

    Google Scholar 

  26. Wöhrle, S., Thomas, W.: Model checking synchronized products of infinite transition systems. In: Proc. 19th LICS, pp. 2–11. IEEE Comp. Soc., Los Alamitos (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen, Lehrstuhl Informatik 7, 52056, Aachen, Germany

    Wolfgang Thomas

Authors
  1. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Bar Ilan University, 52900, Ramat Gan, Israel

    Doron A. Peled

  2. Department of Information Management, National Taiwan University, Taiwan

    Yih-Kuen Tsay

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomas, W. (2005). Some Perspectives of Infinite-State Verification. In: Peled, D.A., Tsay, YK. (eds) Automated Technology for Verification and Analysis. ATVA 2005. Lecture Notes in Computer Science, vol 3707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562948_3

Download citation

  • DOI: https://doi.org/10.1007/11562948_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29209-8

  • Online ISBN: 978-3-540-31969-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation