Abstract
Rigid families, a causal model for concurrency based on configuration structures, can interpret CCS and the \(\pi \)-calculus. However, it is also a causal model suited for reversible calculi. In this paper we use rigid families to give a denotational representation to the reversible \(\pi \)-calculus. The reversible \(\pi \)-calculus defines a causal semantics for the \(\pi \)-calculus as well. We discuss the difference in the two causal representations, in rigid families and in the reversible \(\pi \)-calculus.
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
References
Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004)
Phillips, I., Ulidowski, I.: Reversibility and models for concurrency. Electron. Notes Theor. Comput. Sci. 192, 93–108 (2007)
Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversing higher-order Pi. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 478–493. Springer, Heidelberg (2010)
Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible \(\pi \)-calculus. Proc. LICS 2013, 388–397 (2013)
van Glabbeek, R.J., Plotkin, G.D.: Configuration structures. Proc. LICS 1995, 199–209 (1995)
Castellan, S., Hayman, J., Lasson, M., Winskel, G.: Strategies as concurrent processes. In: Proceedings of the MFPS XXX, ENTCS, vol. 308, pp. 87–107 (2014)
Cristescu, I.D., Krivine, J., Varacca, D.: Rigid families for CCS and the \(\pi \)-calculus. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 223–240. Springer, Heidelberg (2015)
Milner, R.: Communicating and Mobile Systems: The \(\pi \)-Calculus. Cambridge University Press, New York (1999)
Hayman, J., Winskel, G.: Event structure semantics for security protocols. Submitted for Publication (2013)
Crafa, S., Varacca, D., Yoshida, N.: Event structure semantics of parallel extrusion in the Pi-calculus. In: Birkedal, L. (ed.) FOSSACS 2012 and ETAPS 2012. LNCS, vol. 7213, pp. 225–239. Springer, Heidelberg (2012)
Winskel, G.: Event structure semantics for CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages and Programming. LNCS, vol. 140, pp. 561–576. Springer, Heidelberg (1982)
Aubert, C., Cristescu, I.: Reversible barbed congruence on configuration structures. In: Proceedings of the ICE 2015, EPTCS, vol. 189, pp. 68–85 (2015)
van Glabbeek, R.J., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Inf. 37(4/5), 229–327 (2001)
Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signalling pathway. In: Glück, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 218–232. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Cristescu, I., Krivine, J., Varacca, D. (2016). Rigid Families for the Reversible \(\pi \)-Calculus. In: Devitt, S., Lanese, I. (eds) Reversible Computation. RC 2016. Lecture Notes in Computer Science(), vol 9720. Springer, Cham. https://doi.org/10.1007/978-3-319-40578-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-40578-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40577-3
Online ISBN: 978-3-319-40578-0
eBook Packages: Computer ScienceComputer Science (R0)