Event Structure Semantics for Nominal Calculi Export

@incollection{citeulike:3612376, 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.}, author = {Bruni, Roberto and Melgratti, Hern\'{a}n and Montanari, Ugo}, citeulike-article-id = {3612376}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/11817949_20}, citeulike-linkout-1 = {http://www.springerlink.com/content/5438m03486311x71}, doi = {10.1007/11817949_20}, journal = {CONCUR 2006 – Concurrency Theory}, keywords = {causality, concurrency, eventstructure}, pages = {295--309}, posted-at = {2008-11-20 16:00:22}, priority = {2}, title = {Event Structure Semantics for Nominal Calculi}, url = {http://dx.doi.org/10.1007/11817949_20}, year = {2006} }

TY - CHAP ID - citeulike:3612376 L3 - citeulike-article-id:3612376 N2 - 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. JF - CONCUR 2006 – Concurrency Theory EP - 309 TI - Event Structure Semantics for Nominal Calculi SP - 295 KW - causality KW - concurrency KW - eventstructure AU - Bruni, Roberto AU - Melgratti, Hernán AU - Montanari, Ugo PY - 2006/// UR - http://dx.doi.org/10.1007/11817949_20 ER -