Abstract
Classical concurrency in the dpo approach to graph rewriting, as defined by the shift equivalence construction [7], can also be represented by a graph process, a structure where concurrency and causal dependency are synthetically represented by a partial ordering of rewrites [1]. Interestingly, all shift equivalent derivations, considered as diagrams in the category of graphs, have the same colimit, which moreover exactly corresponds to the graph process. This construction, due to Corradini, Montanari and Rossi, was originally defined for rules with injective right-hand morphisms [6]. This condition turns out to be restrictive when graphs are used for modeling process calculi like ambients [4] or fusion [21], where the coalescing of read-only items is essential [11,13]. Recently, a paper by Habel, Müller and Plump [16] considered again shift equivalence, extending classical results to non-injective rules. In this paper we look at the graph-process-via-colimit approach: We propose and motivate its extension to non-injective rules in terms of existing computational models, and compare it with the aforementioned results.
Research partially supported by the EU within the FET – Global Computing Initiative, project agile IST-2001-32747 (Architectures for Mobility).
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., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: Concurrent semantics of algebraic graph transformation. In: Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 3, pp. 107–187. World Scientific, Singapore (1999)
Berry, G., Boudol, G.: The chemical abstract machine. Theor. Comp. Sci. 96, 217–248 (1992)
Bruni, R., Gadducci, F., Montanari, U.: Normal forms for algebras of connections. Theor. Comp. Sci. 286, 247–292 (2002)
Cardelli, L., Gordon, A.: Mobile ambients. Theor. Comp. Sci. 240, 177–213 (2000)
Corradini, A., Gadducci, F.: Rewriting on cyclic structures: Equivalence between the operational and the categorical description. Informatique Théorique et Applications/Theoretical Informatics and Applications 33, 467–493 (1999)
Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26, 241–265 (1996)
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, pp. 163–245. World Scientific, Singapore (1997)
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. Theor. Comp. Sci. 99, 1–63 (1992)
Drewes, F., Habel, A., Kreowski, H.-J.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1. World Scientific, Singapore (1997)
Fu, Y.: Variations on mobile processes. Theor. Comp. Sci. 221, 327–368 (1999)
Gadducci, F.: Term graph rewriting and the π-calculus. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol. 2895, pp. 37–54. Springer, Heidelberg (2003)
Gadducci, F., Heckel, R., Llabrés, M.: A bi-categorical axiomatisation of concurrent graph rewriting. In: Hofmann, M., Pavlovic̀, D., Rosolini, G. (eds.) Category Theory and Computer Science. Electr. Notes in Theor. Comp. Sci., vol. 29. Elsevier Science, Amsterdam (1999)
Gadducci, F., Montanari, U.: A concurrent graph semantics for mobile ambients. In: Brookes, S., Mislove, M. (eds.) Mathematical Foundations of Programming Semantics. Electr. Notes in Theor. Comp. Sci., vol. 45. Elsevier Science, Amsterdam (2001)
Gardner, P., Wischik, L.: Explicit fusion. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 373–382. Springer, Heidelberg (2000)
Golz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Information and Control 57, 125–147 (1983)
Habel, A., Müller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11, 637–688 (2001)
Laneve, C., Parrow, J., Victor, B.: Solo diagrams. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 127–144. Springer, Heidelberg (2001)
Laneve, C., Victor, B.: Solos in concert. Mathematical Structures in Computer Science 13, 675–683 (2002)
Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Part I and II. Information and Computation 100, 1–77 (1992)
Parrow, J., Victor, B.: The fusion calculus: Expressiveness and simmetry in mobile processes. In: Pratt, V. (ed.) Logic in Computer Science, pp. 176–185. IEEE Computer Society Press, Los Alamitos (1998)
Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gadducci, F., Montanari, U. (2005). Graph Processes with Fusions: Concurrency by Colimits, Again. In: Kreowski, HJ., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds) Formal Methods in Software and Systems Modeling. Lecture Notes in Computer Science, vol 3393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31847-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-31847-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24936-8
Online ISBN: 978-3-540-31847-7
eBook Packages: Computer ScienceComputer Science (R0)