Abstract
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal calculi have been modeled with graph grammars, and hence their event structure semantics could be obtained as instances of the general case, the main limitation is that in the case of graph grammars the construction is more complex than strictly necessary for dealing with usual nominal calculi and, speaking in categorical terms, it is not as elegant as in the case of Petri nets. The main contribution of this work is the definition of a particular class of graph grammars, called persistent, that are expressive enough to model name passing calculi while simplifying the denotational domain construction, which can be expressed as an adjunction. Finally, we apply our technique to derive event structure semantics for pi-calculus and join-calculus processes.
Research supported by the EU FET-GC2 IST-2004-16004 Integrated Project Sensoria.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldan, P.: Modelling concurrent computations: from contextual Petri nets to graph grammars. PhD thesis, University of Pisa (2000)
Baldan, P., Corradini, A., König, B.: Verifying Finite-State Graph Grammars: An Unfolding-Based Approach. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 83–98. Springer, Heidelberg (2004)
Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures and processes. Inform. and Comput. 171(1), 1–49 (2001)
Baldan, P., Corradini, A., Montanari, U., Ribeiro, L.: Concurrency and Nondeterminism in Graph Rewriting: From Graph Grammars to Asymmetric Event Structures and Backwards. Technical Report CS-2005-2, University Ca’ Foscari of Venice (2005)
Baldan, P., Gadducci, F., Montanari, U.: Concurrent Semantics for Graph Rewriting with Fusions. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137. Springer, Heidelberg (2006)
Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the pi-calculus. Acta Informatica 35(3), 353–400 (1998)
Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Padberg, J.: The category of typed graph grammars and its adjunctions with categories of derivations. In: Proc. TAGT 1994. LNCS, vol. 1073, pp. 56–74. Springer, Heidelberg (1996)
Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: An event structure semantics for graph grammars with parallel productions. In: Proc. TAGT 1994. LNCS, vol. 1073, pp. 240–256. Springer, Heidelberg (1996)
Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fund. Inf. 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: [21]
Degano, P., Priami, C.: Non-interleaving semantics for mobile processes. Theoret. Comput. Sci. 216(1-2), 237–270 (1999)
Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation II: SPO approach and comparison with DPO. In: [21]
Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the Join calculus. In: Proc. POPL 1996, pp. 372–385. ACM Press, New York (1996)
Gadducci, F.: Term Graph Rewriting for the phi-Calculus. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol. 2895, pp. 37–54. Springer, Heidelberg (2003)
Gadducci, F., Montanari, U.: A Concurrent Graph Semantics for Mobile Ambients. In: Proc. MFPS 2001. ENTCS, vol. 45. Elsevier, Amsterdam (2001)
Golz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Information and Control 57, 125–147 (1983)
Löwe, M.: Algebraic approach to single-pushout graph transformation. Theoret. Comput. Sci. 109, 181–224 (1993)
Meseguer, J., Montanari, U., Sassone, V.: On the semantics of Place/Transition Petri nets. Mathematical Structures in Computer Science 7, 359–397 (1997)
Montanari, U., Pistore, M.: Concurent semantics for the π-calculus. ENTCS 1 (1995)
Nielsen, M., Plotkin, G., Winskel, G.: Petri Nets, Event Structures and Domains, Part 1. Theoret. Comput. Sci. 13, 85–108 (1981)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific, Singapore (1997)
Schied, G.: On relating Rewriting Systems and Graph Grammars to Event Structures. In: Ehrig, H., Schneider, H.-J. (eds.) Dagstuhl Seminar 1993. LNCS, vol. 776, pp. 326–340. Springer, Heidelberg (1994)
Varacca, D., Yoshida, N.: Typed event Structures and the π-calculus. In: Proc. MFPS 2006 (2006)
Winskel, G.: Event Structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruni, R., Melgratti, H., Montanari, U. (2006). Event Structure Semantics for Nominal Calculi. In: Baier, C., Hermanns, H. (eds) CONCUR 2006 – Concurrency Theory. CONCUR 2006. Lecture Notes in Computer Science, vol 4137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11817949_20
Download citation
DOI: https://doi.org/10.1007/11817949_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37376-6
Online ISBN: 978-3-540-37377-3
eBook Packages: Computer ScienceComputer Science (R0)