Skip to main content
Springer Nature Link
Log in

Linear-Ordered Graph Grammars: Applications to Distributed Systems Design

  • Chapter
Concurrency, Graphs and Models

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

  • 829 Accesses

Abstract

Linear-ordered graph grammars (LOGGs) are a special kind of graph grammars that were inspired by the general definitions of graph grammars and by tile systems. In this paper we show that this kind of grammar is particularly suited for the specification of distributed systems. Moreover, we discuss a simple extension of LOGGs inspired by the representation using tiles, leading to a notion of open graphs that can be very useful in a wider range of applications.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bruni, R., Montanari, U.: Dynamic connectors for concurrency. Theor. Comput. Sci. 281(1–2), 131–176 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Corradini, A., Gadducci, F.: An algebraic presentation of term graphs via gs-monoidal categories. Applied Categorical Structures 7, 299–331 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  4. Dotti, F., Mendizabal, O., Santos, O.: Verifying fault-tolerant distributed systems using object-based graph grammars. In: Maziero, C.A., Gabriel Silva, J., Andrade, A.M.S., Assis Silva, F.M.d. (eds.) LADC 2005. LNCS, vol. 3747, pp. 80–100. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Dotti, F., Ribeiro, L., Santos, O.: Specification and analysis of fault behaviours using graph grammars. In: Pfaltz, J.L., Nagl, M., Böhlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 120–133. Springer, Heidelberg (2004)

    Google Scholar 

  6. Ehrig, H., Heckel, R., Korff, M., Lowë, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation II: Single pushout approach and comparison with double pushout approach. In: Handbook of graph grammars and computing by graph transformation, vol. 2, pp. 247–312. World Scientific, Singapore (1997)

    Google Scholar 

  7. Ehrig, H.: Introduction to the algebraic theory of graph grammars. In: Ng, E.W., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol. 73, pp. 1–69. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  8. Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.): Handbook of graph grammars and computing by graph transformation, vol. 3: Concurrency, parallelism and distribution. World Scientific, Singapore (1999)

    MATH  Google Scholar 

  9. Ferrari, G., Montanari, U.: Tile formats for located and mobile systems. Information and Computation 156(1/2), 173–235 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, Cambridge (2000)

    Google Scholar 

  11. Gadducci, F., Montanari, U.: Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theor. Comput. Sci. 285(2), 319–358 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Korff, M.: Generalized graph structures with application to concurrent object-oriented systems, Ph.D. thesis, Technische Universität Berlin (1995)

    Google Scholar 

  13. Lowë, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109, 181–224 (1993)

    Article  Google Scholar 

  14. Meseguer, J., Montanari, U.: Mapping tile logic into rewriting logic. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 62–91. Springer, Heidelberg (1998)

    Google Scholar 

  15. Montanari, U., Ribeiro, L.: Linear ordered graph grammars and their algebraic foundations. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 317–333. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Rozenberg, G.: Handbook of graph grammars and computing by graph transformation, vol. 1: Foundations. World Scientific, Singapore (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil

    Leila Ribeiro

  2. Faculdade de Informática, Pontifícia Universidade Católica do Rio Grande do Sul, Porto Alegre, Brazil

    Fernando Luís Dotti

Authors
  1. Leila Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fernando Luís Dotti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Rocco De Nicola José Meseguer

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ribeiro, L., Dotti, F.L. (2008). Linear-Ordered Graph Grammars: Applications to Distributed Systems Design. In: Degano, P., De Nicola, R., Meseguer, J. (eds) Concurrency, Graphs and Models. Lecture Notes in Computer Science, vol 5065. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68679-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68679-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68676-7

  • Online ISBN: 978-3-540-68679-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics