Advertisement

Ugo Montanari and Graph Transformation

  • Andrea Corradini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5065)

Abstract

Graphs are widely exploited in several fields of computer science (as well as in other disciplines) to represent in a direct and adequate way the structure of the states of a system, making it easily understandable also to a non-technical audience. In many situations, the behaviour of such systems can be specified faithfully with a rule-based approach. A graph rule describes how a state can evolve into another state by replacing a sub-state matching the left-hand side of the rule with its right-hand side.

Keywords

Logic Programming Software Architecture Graph Transformation Graph Grammar State Model Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baier, C., Hermanns, H. (eds.): CONCUR 2006. LNCS, vol. 4137. Springer, Heidelberg (2006)zbMATHGoogle Scholar
  2. 2.
    Baldan, P., Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: Concurrent semantics of algebraic graph transformations. In: Ehrig, H., et al. (eds.) [30], pp. 107–187.Google Scholar
  3. 3.
    Baldan, P., Corradini, A., Montanari, U.: Concatenable graph processes: Relating processes and derivation traces. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 283–295. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  4. 4.
    Baldan, P., Corradini, A., Montanari, U.: Unfolding of double-pushout graph grammars is a coreflection. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 145–163. Springer, Heidelberg (2000)Google Scholar
  5. 5.
    Baldan, P., Corradini, A., Montanari, U.: Unfolding and event structure semantics for graph grammars. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 73–89. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  6. 6.
    Baldan, P., Corradini, A., Montanari, U.: Bisimulation equivalences for graph grammars. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 158–190. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Baldan, P., Corradini, A., Montanari, U.: Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs. In: Proceedings of PNGT 2004. ENTCS, vol. 127(2), pp. 5–28. Elsevier Science, Amsterdam (2005)Google Scholar
  8. 8.
    Baldan, P., Corradini, A., Montanari, U., Ribeiro, L.: Coreflective concurrent semantics for single-pushout graph grammars. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2002. LNCS, vol. 2755, pp. 165–184. Springer, Heidelberg (2003)Google Scholar
  9. 9.
    Baldan, P., Corradini, A., Montanari, U., Ribeiro, L.: Unfolding semantics of graph transformation. Inf. Comput. 205(5), 733–782 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Baldan, P., Gadducci, F., Montanari, U.: Concurrent rewriting for graphs with equivalences. In: Baier and Hermanns [1], pp. 279–294.Google Scholar
  11. 11.
    Baldan, P., Gadducci, F., Montanari, U.: Modelling calculi with name mobility using graphs with equivalences. In: Proceedings of TERMGRAPH 2006. ENTCS, vol. 176(1), pp. 85–97. Elsevier Science, Amsterdam (2007)Google Scholar
  12. 12.
    Bruni, R., Lluch Lafuente, A., Montanari, U.: Hierarchical design rewriting with Maude. In: Proceedings of WRLA 2008. ENTCS, Elsevier, Amsterdam (to appear, 2008)Google Scholar
  13. 13.
    Bruni, R., Lluch Lafuente, A., Montanari, U., Tuosto, E.: Service oriented architectural design. In: TGC 2007. LNCS, vol. 4912, pp. 186–203. Springer, Heidelberg (2007)Google Scholar
  14. 14.
    Bruni, R., Melgratti, H., Montanari, U.: Event structure semantics for nominal calculi. In: Baier, Hermanns (eds.) [1], pp. 295–309.Google Scholar
  15. 15.
    Bruni, R., Melgratti, H., Montanari, U.: Event structure semantics for dynamic graph grammars. In: Baldan, P., Ehrig, H., Padberg, J., Rozenberg, G. (eds.) Proceedings of PNGT 2006, Workshop on Petri Nets and Graph Transformation. ECEASST. EASST, vol. 2 (2007)Google Scholar
  16. 16.
    Castellani, I., Montanari, U.: Graph grammars for distributed systems. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds.) Graph Grammars 1982. LNCS, vol. 153, pp. 20–38. Springer, Heidelberg (1983)CrossRefGoogle Scholar
  17. 17.
    Corradini, A., Degano, P., Montanari, U.: Specifying highly concurrent data structure manipulation. In: Proceedings ACM Int. Comp. Symp, pp. 424–428. North-Holland, Amsterdam (1985)Google Scholar
  18. 18.
    Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: Abstract graph derivations in the double pushout approach. In: Schneider, Ehrig (eds.) [55], pp. 86–103.Google Scholar
  19. 19.
    Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: An event structure semantics for graph grammars with parallel productions. In: Cuny, J.E., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 240–256. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  20. 20.
    Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: An event structure semantics for safe graph grammars. In: Olderog, E.-R. (ed.) PROCOMET. IFIP Transactions, vol. A-56, pp. 423–444. North-Holland, Amsterdam (1994)Google Scholar
  21. 21.
    Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: Note on standard representation of graphs and graph derivations. In: Schneider, Ehrig (eds.) [55], pp. 104–118.Google Scholar
  22. 22.
    Corradini, A., Montanari, U.: An algebra of graphs and graph rewriting. In: Pitt, D.H., Curien, P.-L., Abramsky, S., Pitts, A.M., Poigné, A., Rydeheard, D.E. (eds.) CTCS 1991. LNCS, vol. 530, pp. 236–260. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  23. 23.
    Corradini, A., Montanari, U.: Specification of Concurrent Systems: from Petri Nets to Graph Grammars. In: Hommel, G. (ed.) Quality of Communication-Based Systems, pp. 35–52. Kluwer Academic Publishers, Dordrecht (1995)Google Scholar
  24. 24.
    Corradini, A., Montanari, U., Rossi, F.: CHARM: Concurrency and Hiding in an Abstract Rewriting Machine. In: FGCS, pp. 887–896. IOS Press, Amsterdam (1992)Google Scholar
  25. 25.
    Corradini, A., Montanari, U., Rossi, F.: An abstract machine for concurrent modular systems: CHARM. Theor. Comput. Sci 122(1&2), 165–200 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundam. Inform. 26(3/4), 241–265 (1996)zbMATHMathSciNetGoogle Scholar
  27. 27.
    Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations: Foundations, vol. 1, pp. 163–246. World Scientific, Singapore (1997)Google Scholar
  28. 28.
    Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Löwe, M.: Graph grammars and logic programming. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 221–237. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  29. 29.
    Degano, P., Montanari, U.: A model for distributed systems based on graph rewriting. J. ACM 34(2), 411–449 (1987)CrossRefMathSciNetGoogle Scholar
  30. 30.
    Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.): Handbook on Graph Grammars and Computing by Graph Transformation: Concurrency, Parallelism and Distribution, vol. 3. World Scientific, Singapore (1999)Google Scholar
  31. 31.
    Ferrari, G.L., Hirsch, D., Lanese, I., Montanari, U., Tuosto, E.: Synchronised hyperedge replacement as a model for service oriented computing. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 22–43. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  32. 32.
    Ferrari, G.L., Montanari, U., Tuosto, E.: Graph-based models of internetworking systems. In: Aichernig, B.K., Maibaum, T.S.E. (eds.) Formal Methods at the Crossroads. From Panacea to Foundational Support. LNCS, vol. 2757, pp. 242–266. Springer, Heidelberg (2003)Google Scholar
  33. 33.
    Gadducci, F., Montanari, U.: A concurrent graph semantics for mobile ambients. In: Proceedings of MFPS 2001. ENTCS, vol. 45, Elsevier Science, Amsterdam (2001)Google Scholar
  34. 34.
    Gadducci, F., Montanari, U.: Observing reductions in nominal calculi via a graphical encoding of processes. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R.C. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 106–126. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  35. 35.
    Hirsch, D., Inverardi, P., Montanari, U.: Graph grammars and constraint solving for software architecture styles. In: Magee, J., Perry, D. (eds.) Third International Software Architecture Workshop, Orlando, FL, November 1998, pp. 69–72. ACM Press, New York (1998)CrossRefGoogle Scholar
  36. 36.
    Hirsch, D., Inverardi, P., Montanari, U.: Modeling software architectures and styles with graph grammars and constraint solving. In: Donohoe, P. (ed.) WICSA. IFIP Conference Proceedings, vol. 140, pp. 127–144. Kluwer, Dordrecht (1999)Google Scholar
  37. 37.
    Hirsch, D., Inverardi, P., Montanari, U.: Reconfiguration of software architecture styles with name mobility. In: Porto, A., Roman, G.-C. (eds.) COORDINATION 2000. LNCS, vol. 1906, pp. 148–163. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  38. 38.
    Hirsch, D., Montanari, U.: Consistent transformations for software architecture styles of distributed systems. In: Proceedings WDS 1999. ENTCS, vol. 28, Elsevier Science, Amsterdam (1999)Google Scholar
  39. 39.
    Hirsch, D., Montanari, U.: A graphical calculus for name mobility. In: Roman, G.C., Picco, G.P. (eds.) Proceedings of WSEM 2001, Toronto, Canada (2001)Google Scholar
  40. 40.
    Hirsch, D., Montanari, U.: Synchronized hyperedge replacement with name mobility. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 121–136. Springer, Heidelberg (2001)Google Scholar
  41. 41.
    Hirsch, D., Montanari, U.: Two graph-based techniques for software architecture reconfiguration. In: Proceedings of GETGRATS Closing Workshop. ENTCS, vol. 51, Elsevier Science, Amsterdam (2001)Google Scholar
  42. 42.
    Hirsch, D., Montanari, U.: Shaped hierarchical architectural design. In: Proceedings of GT-VMT 2004. ENTCS, vol. 109, pp. 97–109. Elsevier Science, Amsterdam (2004)Google Scholar
  43. 43.
    König, B., Montanari, U.: Observational equivalence for synchronized graph rewriting with mobility. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 145–164. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  44. 44.
    Lanese, I., Montanari, U.: Software architectures, global computing and graph transformation via logic programming. In: Ribeiro, L. (ed.) Proc SBES 2002 - 16th Brazilian Symposium on Software Engineering, Anais, pp. 11–35 (2002)Google Scholar
  45. 45.
    Lanese, I., Montanari, U.: A graphical fusion calculus. In: Proceedings of the Workshop of the COMETA Project. ENTCS, vol. 104, pp. 199–215. Elsevier Science, Amsterdam (2004)Google Scholar
  46. 46.
    Lanese, I., Montanari, U.: Synchronization algebras with mobility for graph transformations. In: Proceedings of FGUC 2004. ENTCS, vol. 138, Elsevier Science, Amsterdam (2005)Google Scholar
  47. 47.
    Lanese, I., Montanari, U.: Hoare vs Milner: Comparing synchronizations in a graphical framework with mobility. In: Proceedings of GT-VC 2005. ENTCS, vol. 154(2), pp. 55–72. Elsevier Science, Amsterdam (2006)Google Scholar
  48. 48.
    Montanari, U.: Separable graphs, planar graphs and web grammars. Information and Control 16(3), 243–267 (1970)zbMATHCrossRefMathSciNetGoogle Scholar
  49. 49.
    Montanari, U., Pistore, M., Rossi, F.: Modeling concurrent, mobile and coordinated systems via graph transformations. In: Ehrig, H., et al. (eds.) [30], pp. 189–268.Google Scholar
  50. 50.
    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)CrossRefGoogle Scholar
  51. 51.
    Montanari, U., Rossi, F.: Graph grammars as context-dependent rewriting systems: A partial ordering semantics. In: Raoult, J.-C. (ed.) CAAP 1992. LNCS, vol. 581, pp. 232–247. Springer, Heidelberg (1992)Google Scholar
  52. 52.
    Montanari, U., Rossi, F.: Graph rewriting and constraint solving for modelling distributed systems with synchronization (extended abstract). In: Ciancarini, P., Hankin, C. (eds.) COORDINATION 1996. LNCS, vol. 1061, Springer, Heidelberg (1996)Google Scholar
  53. 53.
    Pfaltz, J.L., Rosenfeld, A.: Web grammars. In: IJCAI, pp. 609–620 (1969)Google Scholar
  54. 54.
    Rossi, F., Montanari, U.: Hypergraph grammars and networks of constraints versus logic programming and metaprogramming. In: Proceedings of META 1988, pp. 531–544. MIT Press, Cambridge (1988)Google Scholar
  55. 55.
    Schneider, H.J., Ehrig, H.: Dagstuhl Seminar 1993. LNCS, vol. 776. Springer, Heidelberg (1994)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Andrea Corradini
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaItaly

Personalised recommendations