L. Aceto and M. Hennessy, Towards action-refinement in process algebras, LICS, pp.138-145, 1989.

C. Baier and M. E. Majster-cederbaum, The connection between an event structure semantics and an operational semantics for TCSP, Acta Informatica, vol.31, issue.1, pp.81-104, 1994.

P. Baldan, A. Corradini, and F. Gadducci, Domains and event structures for fusions, LICS, pp.1-12, 2017.
DOI : 10.1109/lics.2017.8005135

URL : http://arxiv.org/pdf/1701.02394

M. Bednarczyk, Categories of Asynchronous Systems, 1988.

M. Boreale and D. Sangiorgi, A fully abstract semantics for causality in the ?-calculus, Acta Informatica, vol.35, issue.5, pp.353-400, 1998.

G. Boudol and I. Castellani, On the semantics of concurrency: partial orders and transition systems, LNCS, vol.249, pp.123-137, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00076004

G. Boudol and I. Castellani, Permutation of transitions: an event structure semantics for CCS and SCCS, REX: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, vol.354, pp.411-427, 1988.

G. Boudol and I. Castellani, Flow models of distributed computations: event structures and nets, INRIA, 1991.
URL : https://hal.archives-ouvertes.fr/inria-00075080

G. Boudol and I. Castellani, Flow models of distributed computations: three equivalent semantics for CCS. Information and Computation, vol.114, pp.247-314, 1994.
URL : https://hal.archives-ouvertes.fr/inria-00075078

S. Brookes, C. Hoare, and A. Roscoe, A theory of communicating sequential processes, Journal of ACM, vol.31, issue.3, pp.560-599, 1984.

R. Bruni, H. C. Melgratti, and U. Montanari, Event structure semantics for nominal calculi, LNCS, vol.4137, pp.295-309, 2006.

L. Caires and F. Pfenning, Session types as intuitionistic linear propositions, LNCS, vol.6269, pp.222-236, 2010.

G. L. Cattani and P. Sewell, Models for name-passing processes: interleaving and causal. Information and Computation, vol.190, pp.136-178, 2004.

S. Crafa, D. Varacca, and N. Yoshida, Compositional event structure semantics for the internal ?-calculus, LNCS, vol.4703, pp.317-332, 2007.

S. Crafa, D. Varacca, and N. Yoshida, Event structure semantics of parallel extrusion in the ?-calculus, LNCS, vol.7213, pp.225-239, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00687502

I. Cristescu, Operational and denotational semantics for the reversible ?-calculus, 2015.

I. Cristescu, J. Krivine, and D. Varacca, Rigid families for CCS and the ?-calculus, LNCS, vol.9399, pp.223-240, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01189062

I. Cristescu, J. Krivine, and D. Varacca, Rigid families for the reversible ?-calculus, Reversible Computation, vol.9720, pp.3-19, 2016.

P. Darondeau and P. Degano, Refinement of actions in event structures and causal trees, Theoretical Computer Science, vol.118, issue.1, pp.21-48, 1993.

P. Degano, R. D. Nicola, and U. Montanari, On the consistency of truly concurrent operational and denotational semantics, 1988.

P. Degano, R. D. Nicola, and U. Montanari, A partial ordering semantics for CCS, Theoretical Computer Science, vol.75, issue.3, pp.223-262, 1990.

P. Degano and U. Montanari, Concurrent histories: A basis for observing distributed systems, Journal of Computer and System Sciences, vol.34, issue.2/3, pp.422-461, 1987.

P. Degano and C. Priami, Non-interleaving semantics for mobile processes, Theoretical Computer Science, vol.216, issue.1-2, pp.237-270, 1999.

P. Deniélou and N. Yoshida, Multiparty session types meet communicating automata, LNCS, vol.7211, pp.194-213, 2012.

U. Goltz, R. Gorrieri, and A. Rensink, Comparing syntactic and semantic action refinement. Information and Computation, vol.125, pp.118-143, 1996.

E. Graversen, I. Phillips, and N. Yoshida, Towards a categorical representation of reversible event structures, EPTCS, vol.246, pp.49-60, 2017.

E. Graversen, I. Phillips, and N. Yoshida, Event structure semantics of (controlled) reversible CCS, Reversible Computation, vol.11106, pp.122-102, 2018.

K. Honda, V. T. Vasconcelos, and M. Kubo, Language primitives and type discipline for structured communication-based programming, LNCS, vol.1381, pp.122-138, 1998.

K. Honda, N. Yoshida, and M. Carbone, Multiparty asynchronous session types, POPL, pp.273-284, 2008.

K. Honda, N. Yoshida, and M. Carbone, Multiparty asynchronous session types, Journal of ACM, vol.63, issue.1, p.67, 2016.

L. J. Jagadeesan and R. Jagadeesan, Causality and true concurrency: A data-flow analysis of the ?-calculus (extended abstract), LNCS, vol.936, pp.277-291, 1995.

J. Katoen, Quantitative and qualitative extensions of event structures, 1996.

J. Lange, E. Tuosto, and N. Yoshida, From communicating machines to graphical choreographies, POPL, pp.221-232, 2015.

R. Langerak, Bundle event structures: a non-interleaving semantics for LOTOS, Formal Description Techniques for Distributed Systems and Communication Protocols, pp.331-346, 1993.

R. Loogen and U. Goltz, Modelling nondeterministic concurrent processes with event structures, Fundamenta Informaticae, vol.14, issue.1, pp.39-74, 1991.

R. Milner, A Calculus of Communicating Systems, LNCS. Springer, vol.92, 1980.

U. Montanari and M. Pistore, Concurrent semantics for the ?-calculus, vol.1, pp.411-429, 1995.

M. Nielsen, G. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.

E. Olderog, TCSP: theory of communicating sequential processes, Advances in Petri Nets, vol.255, pp.441-465, 1986.

I. Phillips and I. Ulidowski, Reversibility and asymmetric conflict in event structures, Journal of Logical and Algebraic Methods in Programming, vol.84, issue.6, pp.781-805, 2015.

B. C. Pierce, Types and Programming Languages, 2002.

K. Takeuchi, K. Honda, and M. Kubo, An interaction-based language and its typing system, LNCS, vol.817, pp.122-138, 1994.

B. Toninho, L. Caires, and F. Pfenning, Dependent session types via intuitionistic linear type theory, PPDP, pp.161-172, 2011.

R. J. Van-glabbeek and U. Goltz, Well-behaved flow event structures for parallel composition and action refinement, Theoretical Computer Science, vol.311, issue.1-3, pp.463-478, 2004.

D. Varacca and N. Yoshida, Typed event structures and the linear ?-calculus, Theoretical Computer Science, vol.411, issue.19, pp.1949-1973, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00496903

P. Wadler, Propositions as sessions, Journal of Functional Programming, vol.24, issue.2-3, pp.384-418, 2014.

G. Winskel, Events in Computation, 1980.

G. Winskel, Event structure semantics for CCS and related languages, LNCS, vol.140, pp.561-576, 1982.

G. Winskel, An introduction to event structures, REX: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, vol.354, pp.364-397, 1988.

, Note that the mapping p?q ? [?] ? is undefined whenever either [?] ? = {p?q} or one of p, q occurs in ?, but p?q is not their first communication. Proposition A.5 1. If ? ? ? is defined

A. ,

, From the fact that in any communication sequence ? 1 and ? 2 can be swapped

, Otherwise either ? = [?] ? , in which case we are done, or one of p, q occurs in ?, but ? is not their first communication. We show that this last case is impossible. In fact if one of p, q occurs in ?, then one of p, q occurs in ? ? ?, If ? ? ? is defined by Point 4 ? ? ? < ? ? (? ? ? ) and by Point 2 ? ? (? ? ? ) = ?

. G-=-g, G 2 and [p?q] ? ? GE(G i ) for either i = 1 or i = 2

, where in the second case [p?q] ? ? GE(G i ) for all i ? I holds by definition of projection