Skip to main content
SpringerLink
Log in

Recognizable Graph Languages for the Verification of Dynamic Systems

  • Conference paper
Graph Transformations (ICGT 2010)

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

Included in the following conference series:

Abstract

The theory of regular word languages has a large number of applications in computer science, especially in verification. The notion of regularity can be straightforwardly generalized to trees and tree automata. Therefore it is natural to ask for a theory of regular graph languages.

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. Andersen, H.R.: An introduction to binary decision diagrams. Course Notes (1997)

    Google Scholar 

  2. Berstel, J.: Transductions and Context-Free Languages. Teubner Verlag (1979)

    Google Scholar 

  3. Blume, C.: Graphsprachen für die Spezifikation von Invarianten bei verteilten und dynamischen Systemen. Master’s thesis, Universität Duisburg-Essen (2008)

    Google Scholar 

  4. Blume, C., Bruggink, S., König, B.: Recognizable graph languages for checking invariants. In: Proc. of GT-VMT 2010. Elec. Communications of the EASST (2010)

    Google Scholar 

  5. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking of complex dynamic data structures. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 52–70. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Bozapalidis, S., Kalampakas, A.: Graph automata. Theor. Comp. Sci. 393 (2008)

    Google Scholar 

  8. Bruggink, S., König, B.: On the recognizability of arrow and graph languages. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 336–350. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Cimatti, A., Roveri, M., Bertoli, P.: Searching powerset automata by combining explicit-state and symbolic model checking. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, p. 313. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inf. Comput. 85(1) (1990)

    Google Scholar 

  11. Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of Graph Grammars and Computing by Graph Transformation, ch. 5. Foundations, vol. 1. World Scientific, Singapore (1997)

    Google Scholar 

  12. de Luca, A., Varricchio, S.: Well quasi-orders and regular languages. Acta Inf. 31(6) (1994)

    Google Scholar 

  13. Sassone, V., Sobociński, P.: Reactive systems over cospans. In: LICS (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Duisburg-Essen, Germany

    Christoph Blume

Authors
  1. Christoph Blume
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Franklinstr. 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  2. Afdeling Informatica, Universiteit Twente, Drienerlolaan 5, 7522, Enschede, NB, The Netherlands

    Arend Rensink

  3. Leiden Institute of Advanced Computer Science (LIACS), Universiteit Leiden, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  4. Fachgebiet Echtzeitsysteme, Technische Universität Darmstadt, Merckstraße 25, 64283, Darmstadt, Germany

    Andy Schürr

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blume, C. (2010). Recognizable Graph Languages for the Verification of Dynamic Systems. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds) Graph Transformations. ICGT 2010. Lecture Notes in Computer Science, vol 6372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15928-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15928-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15927-5

  • Online ISBN: 978-3-642-15928-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation