Abstract
We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally or globally restricted nodes. Such graphs allow to represent explicitly and at the right level of abstraction some relevant topological and logical features of models and systems, including nesting, hierarchies, sharing of resources, and pointers or links. We also provide an encoding of the proposed algebra into terms of a gs-monoidal theory, and through these into a suitable class of ”wellscoped” term graphs, showing that this encoding is sound and complete with respect to the axioms of the algebra.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baldan, P., Corradini, A., König, B.: A framework for the verification of infinite-state graph transformation systems. Information and Computation 206(7), 869–907 (2008)
Barendregt, H., van Eekelen, M., Glauert, J., Kennaway, J., Plasmeijer, M., Sleep, M.: Term graph reduction. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 141–158. Springer, Heidelberg (1987)
Boreale, M., Bruni, R., Nicola, R.D., Loreti, M.: Sessions and pipelines for structured service programming. In: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol. 5051, pp. 19–38. Springer, Heidelberg (2008)
Bruni, R., Gadducci, F., Montanari, U.: Normal forms for algebras of connections. Theoretical Computer Science 286, 247–292 (2002)
Bruni, R., Corradini, A., Montanari, U.: Modeling a service and session calculus with hierarchical graph transformation (2010) (submitted)
Bruni, R., Gadducci, F., Lluch Lafuente, A.: An algebra of hierarchical graphs and its application to structural encoding. Scientific Annals in Computer Science (to appear, 2010)
Bruni, R., Gadducci, F., Lluch Lafuente, A.: A graph syntax for processes and services. In: Laneve, C., Su, J. (eds.) Web Services and Formal Methods. LNCS, vol. 6194, pp. 46–60. Springer, Heidelberg (2010)
Bruni, R., Melgratti, H.C., Montanari, U.: Theoretical foundations for compensations in flow composition languages. In: Palsberg, J., Abadi, M. (eds.) POPL 2005, pp. 209–220. ACM, New York (2005)
Busatto, G., Kreowski, H.J., Kuske, S.: Abstract hierarchical graph transformation. Mathematical Structures in Computer Science 15(4), 773–819 (2005)
Corradini, A., Gadducci, F.: An algebraic presentation of term graphs, via gs-monoidal categories. Applied Categorical Structures 7(4), 299–331 (1999)
Corradini, A., Montanari, U., Rossi, F.: An abstract machine for concurrent modular systems: CHARM. Theoretical Computer Science 122(1&2), 165–200 (1994)
Căzănescu, V.E., Ştefănescu, G.: A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization. Theoretical Computer Science 99(1), 1–63 (1992)
Drewes, F., Hoffmann, B., Plump, D.: Hierarchical graph transformation. Journal on Computer and System Sciences 64(2), 249–283 (2002)
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)
Ferrari, G.L., Montanari, U.: Tile formats for located and mobile systems. Information and Computation 156(1-2), 173–235 (2000)
Gadducci, F.: Graph rewriting for the pi-calculus. Mathematical Structures in Computer Science 17(3), 407–437 (2007)
Grohmann, D., Miculan, M.: Graph algebras for bigraphs. In: Ermel, C., de Lara, J., Heckel, R. (eds.) GT-VMT 2010. Electronic Communications of the EASST, vol. 29 (2010)
Harel, D.: On visual formalisms. Communication of the ACM 31(5), 514–530 (1988)
Milner, R.: Communicating and Mobile Systems. Cambridge University Press, Cambridge (1992)
Milner, R.: Pure bigraphs: Structure and dynamics. Information and Computation 204(1), 60–122 (2006)
Pratt, T.W.: Definition of programming language semantics using grammars for hierarchical graphs. In: Claus, V., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol. 73, pp. 389–400. Springer, Heidelberg (1979)
Selinger, P.: A survey of graphical languages for monoidal categories. In: Coecke, B. (ed.) New Structures for Physics. Lecture Notes in Physics. Springer, Heidelberg (to appear, 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bruni, R., Corradini, A., Gadducci, F., Lluch Lafuente, A., Montanari, U. (2010). On GS-Monoidal Theories for Graphs with Nesting. In: Engels, G., Lewerentz, C., Schäfer, W., Schürr, A., Westfechtel, B. (eds) Graph Transformations and Model-Driven Engineering. Lecture Notes in Computer Science, vol 5765. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17322-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-17322-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17321-9
Online ISBN: 978-3-642-17322-6
eBook Packages: Computer ScienceComputer Science (R0)