Skip to main content
SpringerLink
Log in

The Reachability Problem over Infinite Graphs

  • Conference paper
Computer Science - Theory and Applications (CSR 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5675))

Included in the following conference series:

Abstract

We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinite-state systems. Our focus is on graphs that are presented in terms of word or tree rewriting systems.

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. Altenbernd, J.: On bifix systems and generalizations. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 40–51. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Bouajjani, A., Esparza, J., Maler, O.: Reachability Analysis of Pushdown Automata: Application to Model-Checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135–150. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  3. Blumensath, A., Grädel, E.: Finite Presentations of Infinite Structures: Automata and Interpretations. Theory of Computing Systems 37, 641–674 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Büchi, J.R.: Finite Automata, Their Algebras and Grammars. In: Siefkes, D. (ed.). Springer, New York (1989)

    Google Scholar 

  5. Caucal, D.: On the Regular Structure of Prefix Rewriting. Theor. Comput. Sci. 106, 61–86 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

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

  8. Dauchet, M., Tison, S., Heuillard, T., Lescanne, P.: Decidability of the Confluence of Ground Term Rewriting Systems. In: Proc. LICS 1987, pp. 353–359 (1987)

    Google Scholar 

  9. Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient Algorithms for Model Checking Pushdown Systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 232–247. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256, 63–92 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Karhumäki, J., Kunc, M., Okhotin, A.: Communication of Two Stacks and Rewriting. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol. 4052, pp. 468–479. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Karhumäki, J., Kunc, M., Okhotin, A.: Computing by commuting. Theor. Comput. Sci. 356, 200–211 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Löding, C.: Infinite graphs generated by tree rewriting. PhD thesis, RWTH Aachen, Germany (2003)

    Google Scholar 

  14. Löding, C.: Reachability problems on regular ground tree rewriting graphs. Theory of Computing Systems 39, 347–383 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Löding, C., Spelten, A.: Transition Graphs of Rewriting Systems over Unranked Trees. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 67–77. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, NJ (1967)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. Quine, W.V.: Concatenation as a Basis for Arithmetic. J. Symb. Logic 11, 105–114 (1946)

    Article  MathSciNet  MATH  Google Scholar 

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

  20. Thue, A.: Die Lösung eines Spezialfalles eines allgemeinen logischen Problems, Kra. Videnskabs-Selskabets Skrifter, I. Mat. Nat. Kl. 1910, No. 8, Kristiania (1910); reprinted in: Nagel, T., et. al (eds.) Selected Mathematical Papers of Axel Thue. Universitetsforlaget, Oslo (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen University, 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. Sobolev Institute of Mathematics SB RAS, 4 Koptyug av, 630090, Novosibirsk, Russia

    Anna Frid

  2. Sobolev Institute of Mathematics SB RAS, Koptyug av. 4, 630090, Novosibirsk, Russia

    Andrey Morozov

  3. Max Planck Institute for Software Systems, Campus E1 4, 66123, Saarbrücken, Germany

    Andrey Rybalchenko

  4. Lehrstuhl für Theoretische Informatik, Institut für Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97974, Würzburg, Germany

    Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomas, W. (2009). The Reachability Problem over Infinite Graphs. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds) Computer Science - Theory and Applications. CSR 2009. Lecture Notes in Computer Science, vol 5675. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03351-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03351-3_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03350-6

  • Online ISBN: 978-3-642-03351-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation