Skip to main content
SpringerLink
Log in
Book cover

International Conference on Graph Transformation

ICGT 2017: Graph Transformation pp 73–89Cite as

Specifying Graph Languages with Type Graphs

  • Conference paper
  • First Online:

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

Abstract

We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped homomorphically to a given type graph. In this context, we also study languages specified by restriction graphs and their relation to type graphs. Second, we extend this basic approach to a type graph logic and, third, to type graphs with annotations. We present decidability results and closure properties for each of the formalisms.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    A more detailed overview over related formalisms is given in the conclusion (Sect. 6).

  2. 2.

    Note that in [15] graphs are simple, but it can be easily seen that for our purposes the results can be transferred straightforwardly.

  3. 3.

    We refer to Lemma 2.3, Lemma 2.5 and Theorem 3.1 in [15].

References

  1. Abdulla, P.A., Holík, L., Jonsson, B., Lengál, O., Trinh, C.Q., Vojnar, T.: Verification of heap manipulating programs with ordered data by extended forest automata. In: Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 224–239. Springer, Cham (2013). doi:10.1007/978-3-319-02444-8_17

    Chapter  Google Scholar 

  2. Blume, C., Bruggink, H.J.S., Engelke, D., König, B.: Efficient symbolic implementation of graph automata with applications to invariant checking. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 264–278. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33654-6_18

    Chapter  Google Scholar 

  3. Blume, C., Sander Bruggink, H.J., Friedrich, M., König, B.: Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. J. Vis. Lang. Comput. 24(3), 192–206 (2013)

    Article  Google Scholar 

  4. Bruggink, H.J.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). doi:10.1007/978-3-540-87405-8_23

    Chapter  Google Scholar 

  5. Clarke, E.M., Grumberg, O., Jha, S., Yuan, L., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752–794 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Corradini, A., König, B., Nolte, D.: Specifying graph languages with type graphs, arXiv:1704.05263 (2017)

  7. Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26(3/4), 241–265 (1996)

    MathSciNet  MATH  Google Scholar 

  8. Courcelle, B.: The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Inf. Comput. 85, 12–75 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic, A Language-Theoretic Approach. Cambridge University Press, New York (2012)

    Book  MATH  Google Scholar 

  10. Distefano, D., O’Hearn, P.W., Yang, H.: A local shape analysis based on separation logic. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 287–302. Springer, Heidelberg (2006). doi:10.1007/11691372_19

    Chapter  Google Scholar 

  11. Endrullis, J., Zantema, H.: Proving non-termination by finite automata. In: RTA 2015, vol. 36. LIPIcs, pp. 160–176. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)

    Google Scholar 

  12. Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992). doi:10.1007/BFb0013875

  13. Habel, A., Pennemann, K.-H.: Nested constraints and application conditions for high-level structures. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 293–308. Springer, Heidelberg (2005). doi:10.1007/978-3-540-31847-7_17

    Chapter  Google Scholar 

  14. Heckel, R., Wagner, A.: Ensuring consistency of conditional graph rewriting - a constructive approach. In: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, vol. 2, ENTCS (1995)

    Google Scholar 

  15. Nešetřil, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterisations). J. Comb. Theory Ser. B 80, 80–97 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. O’Hearn, P.W.: Resources, concurrency and local reasoning. Theor. Comput. Sci. 375(1–3), 271–307 (2007). Reynolds Festschrift

    Article  MathSciNet  MATH  Google Scholar 

  17. Orejas, F., Ehrig, H., Prange, U.: A logic of graph constraints. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 179–198. Springer, Heidelberg (2008). doi:10.1007/978-3-540-78743-3_14

    Chapter  Google Scholar 

  18. Pennemann, K.-H.: Development of Correct Graph Transformation Systems. Ph.D. thesis, Universität Oldenburg, May 2009

    Google Scholar 

  19. Rensink, A.: Canonical graph shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 401–415. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24725-8_28

    Chapter  Google Scholar 

  20. Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319–335. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30203-2_23

    Chapter  Google Scholar 

  21. Rozenberg, G., (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations. World Scientific (1997)

    Google Scholar 

  22. Rutle, A., Rossini, A., Lamo, Y., Wolter, U.: A diagrammatic formalisation of MOF-based modelling languages. In: Oriol, M., Meyer, B. (eds.) TOOLS EUROPE 2009. LNBIP, vol. 33, pp. 37–56. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02571-6_4

    Chapter  Google Scholar 

  23. Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. TOPLAS (ACM Trans. Program. Lang. Syst.) 24(3), 217–298 (2002)

    Article  Google Scholar 

  24. Steenken, D., Wehrheim, H., Wonisch, D.: Sound and complete abstract graph transformation. In: Simao, A., Morgan, C. (eds.) SBMF 2011. LNCS, vol. 7021, pp. 92–107. Springer, Heidelberg (2011). doi:10.1007/978-3-642-25032-3_7

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Università di Pisa, Pisa, Italy

    Andrea Corradini

  2. Universität Duisburg-Essen, Duisburg, Germany

    Barbara König & Dennis Nolte

Authors
  1. Andrea Corradini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barbara König
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dennis Nolte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dennis Nolte .

Editor information

Editors and Affiliations

  1. Universidad Autónoma de Madrid, Madrid, Spain

    Juan de Lara

  2. University of York, York, United Kingdom

    Detlef Plump

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Corradini, A., König, B., Nolte, D. (2017). Specifying Graph Languages with Type Graphs. In: de Lara, J., Plump, D. (eds) Graph Transformation. ICGT 2017. Lecture Notes in Computer Science(), vol 10373. Springer, Cham. https://doi.org/10.1007/978-3-319-61470-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61470-0_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61469-4

  • Online ISBN: 978-3-319-61470-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation