C. Aubert and I. Cristescu, Reversible Barbed Congruence on Configuration Structures, ICE 2015 of Electronic Proceedings in Theoretical Computer Science, pp.68-95, 2015.
DOI : 10.4204/EPTCS.189.7
URL : https://hal.archives-ouvertes.fr/hal-01157974

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

L. Bougé, On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes, Acta Informatica, vol.25, issue.2, pp.179-201, 1988.
DOI : 10.1007/BF00263584

V. Danos and J. Krivine, Reversible Communicating Systems, CONCUR, pp.292-307, 2004.
DOI : 10.1007/BFb0012800
URL : https://hal.archives-ouvertes.fr/hal-00784051

V. Danos, J. Krivine, and F. Tarissan, Self-assembling Trees, Electronic Notes in Theoretical Computer Science, vol.175, issue.1, 2007.
DOI : 10.1016/j.entcs.2006.11.017
URL : https://hal.archives-ouvertes.fr/hal-00155303

I. Phillips and I. Ulidowski, Reversibility and Models for Concurrency, Electronic Notes in Theoretical Computer Science, vol.192, issue.1, pp.93-108, 2007.
DOI : 10.1016/j.entcs.2007.08.018

M. Nielsen, G. D. Plotkin, and G. , Petri nets, event structures and domains, Proceedings of the International Symposium, pp.266-28410, 1007.
DOI : 10.1007/BFb0022474

R. J. Van-glabbeek and G. D. Plotkin, Configuration structures, event structures and Petri nets, Theoretical Computer Science, vol.410, issue.41, pp.4111-4159, 2009.
DOI : 10.1016/j.tcs.2009.06.014

K. Honda and N. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.151, issue.2, pp.437-486, 1995.
DOI : 10.1016/0304-3975(95)00074-7

R. De-nicola, U. Montanari, and F. W. Vaandrager, Back and forth bisimulations, CONCUR '90, pp.152-165, 1990.
DOI : 10.1007/BFb0039058

I. Phillips and I. Ulidowski, A hierarchy of reverse bisimulations on stable configuration structures, Mathematical Structures in Computer Science, vol.812, issue.02, pp.333-372, 2012.
DOI : 10.1016/j.jlap.2006.11.002

M. A. Bednarczyk, Hereditary history preserving bisimulations or what is the power of the future perfect in program logics, Instytut Podstaw Informatyki PAN filia w Gda?sku, 1991.

P. Baldan and S. Crafa, A logic for true concurrency, Journal of the ACM, vol.61, issue.4

W. Vogler, Bisimulation and action refinement, Theoretical Computer Science, vol.114, issue.1, pp.173-200, 1993.
DOI : 10.1016/0304-3975(93)90157-O

I. Lanese, C. A. Mezzina, and J. Stefani, Reversing Higher-Order Pi, CONCUR, pp.478-493, 2010.
DOI : 10.1007/978-3-642-15375-4_33

R. Milner, Communication and Concurrency, PHI Series in computer science, 1989.

G. Winskel and M. Nielsen, Models for concurrency, Semantic Modelling of Handbook of Logic in Computer Science, pp.1-148, 1995.

V. Danos and J. Krivine, Transactions in RCCS, CONCUR, pp.398-412, 2005.
DOI : 10.1007/11539452_31
URL : https://hal.archives-ouvertes.fr/hal-00164585

J. Krivine, Algèbres de processus réversible -programmation concurrente déclarative URL https, 2006.

B. Accattoli, Evaluating functions as processes, TERMGRAPH 2013, pp.41-55, 2013.
DOI : 10.4204/EPTCS.110.6

I. Cristescu, J. Krivine, and D. Varacca, A Compositional Semantics for the Reversible p-Calculus, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.388-397, 2013.
DOI : 10.1109/LICS.2013.45

R. Milner and D. Sangiorgi, Barbed bisimulation, ICALP, pp.685-695, 1992.
DOI : 10.1007/3-540-55719-9_114

J. Madiot, Higher-order languages: dualities and bisimulation enhancements, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01141067

G. Boudol and I. Castellani, On the semantics of concurrency: Partial orders and transition systems, TAPSOFT'87, pp.123-137, 1987.
DOI : 10.1007/3-540-17660-8_52
URL : https://hal.archives-ouvertes.fr/inria-00076004

R. J. Van-glabbeek and U. Goltz, Equivalence notions for concurrent systems and refinement of actions, MFCS, pp.237-248, 1989.
DOI : 10.1007/3-540-51486-4_71

A. Joyal, M. Nielsen, and G. , Bisimulation from Open Maps, BRICS Report Series, vol.1, issue.7, 1996.
DOI : 10.7146/brics.v1i7.21663

I. Phillips and I. Ulidowski, Reversing algebraic process calculi, The Journal of Logic and Algebraic Programming, pp.70-96, 2007.

R. J. Van-glabbeek, History preserving process graphs, 1996.

R. J. Van-glabbeek and U. Goltz, Refinement of actions and equivalence notions for concurrent systems, Acta Informatica, vol.37, issue.4-5, pp.229-327, 2001.
DOI : 10.1007/s002360000041

G. Boudol and I. Castellani, A non-interleaving semantics for CCS based on proved transitions, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00075636

D. Sangiorgi, On the origins of bisimulation and coinduction, ACM Transactions on Programming Languages and Systems, vol.31, issue.4

M. P. Fiore, G. L. Cattani, and G. , Weak bisimulation and open maps, LICS IEEE Computer SocietyLICS, pp.67-76, 1999.

G. Boudol and I. Castellani, A non-interleaving semantics for CCS based on proved transitions, Fundamenta Informaticae, vol.11, pp.433-452, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00075636