Abstract
CCSK is a reversible form of CCS which is causal, meaning that actions can be reversed if and only if each action caused by them has already been reversed; there is no control on whether or when a computation reverses. We propose an event structure semantics for CCSK. For this purpose we define a category of reversible bundle event structures, and use the causal subcategory to model CCSK. We then modify CCSK to control the reversibility with a rollback primitive, which reverses a specific action and all actions caused by it. To define the event structure semantics of rollback, we change our reversible bundle event structures by making the conflict relation asymmetric rather than symmetric, and we exploit their capacity for non-causal reversibility.
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
Aubert, C., Cristescu, I.: Contextual equivalences in configuration structures and reversibility. JLAMP 86(1), 77–106 (2017). https://doi.org/10.1016/j.jlamp.2016.08.004
Boudol, G., Castellani, I.: Permutation of transitions: an event structure semantics for CCS and SCCS. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1988. LNCS, vol. 354, pp. 411–427. Springer, Heidelberg (1989). https://doi.org/10.1007/BFb0013028
Castellan, S., Hayman, J., Lasson, M., Winskel, G.: Strategies as concurrent processes. Electr. Notes Theor. Comput. Sci. 308, 87–107 (2014). https://doi.org/10.1016/j.entcs.2014.10.006
Crafa, S., Varacca, D., Yoshida, N.: Event structure semantics of parallel extrusion in the pi-calculus. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 225–239. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28729-9_15
Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible pi-calculus. In: IEEE Symposium on Logic in Computer Science, LICS 2013, pp. 388–397. IEEE Computer Society, Washington, DC (2013). https://doi.org/10.1109/LICS.2013.45
Cristescu, I., Krivine, J., Varacca, D.: Rigid families for the reversible \(\pi \)-calculus. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 3–19. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40578-0_1
Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-28644-8_19
Fecher, H., Majster-Cederbaum, M., Wu, J.: Bundle event structures: a revised cpo approach. Inf. Process. Lett. 83(1), 7–12 (2002). https://doi.org/10.1016/S0020-0190(01)00310-6
Lanese, I., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Controlling reversibility in higher-order pi. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 297–311. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23217-6_20
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). https://doi.org/10.1007/978-3-642-15375-4_33
Langerak, R.: Transformations and semantics for LOTOS. Ph.D. thesis, Universiteit Twente (1992). https://books.google.com/books?id=qB4EAgAACAAJ
Medić, D., Mezzina, C.A.: Static vs dynamic reversibility in CCS. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 36–51. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40578-0_3
Mezzina, C.A., Koutavas, V.: A safety and liveness theory for total reversibility. In: TASE, pp. 1–8, September 2017. https://doi.org/10.1109/TASE.2017.8285635
Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol. 70, pp. 266–284. Springer, Heidelberg (1979). https://doi.org/10.1007/BFb0022474
Phillips, I., Ulidowski, I.: Reversibility and models for concurrency. Electr. Notes Theor. Comput. Sci. 192(1), 93–108 (2007). https://doi.org/10.1016/j.entcs.2007.08.018
Phillips, I., Ulidowski, I.: Reversibility and asymmetric conflict in event structures. JLAMP 84(6), 781–805 (2015). https://doi.org/10.1016/j.jlamp.2015.07.004. Special Issue on Open Problems in Concurrency Theory
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). https://doi.org/10.1007/978-3-642-36315-3_18
Phillips, I., Ulidowski, I., Yuen, S.: Modelling of bonding with processes and events. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 141–154. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38986-3_12
Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Algebraic Logic Program. 73(1–2), 70–96 (2007). https://doi.org/10.1016/j.jlap.2006.11.002
Vaandrager, F.W.: A simple definition for parallel composition of prime event structures. CS R 8903, Centre for Mathematics and Computer Science, P. O. box 4079, 1009 AB Amsterdam, The Netherlands (1989)
Winskel, G.: Event structure semantics for CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 561–576. Springer, Heidelberg (1982). https://doi.org/10.1007/BFb0012800
Acknowledgements
We thank the referees of RC 2018 for their helpful comments. This work was partially supported by EPSRC DTP award; EPSRC projects EP/K034413/1, EP/K011715/1, EP/L00058X/1, EP/N027833/1 and EP/N028201/1; and EU COST Action IC1405.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Graversen, E., Phillips, I., Yoshida, N. (2018). Event Structure Semantics of (controlled) Reversible CCS. In: Kari, J., Ulidowski, I. (eds) Reversible Computation. RC 2018. Lecture Notes in Computer Science(), vol 11106. Springer, Cham. https://doi.org/10.1007/978-3-319-99498-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-99498-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99497-0
Online ISBN: 978-3-319-99498-7
eBook Packages: Computer ScienceComputer Science (R0)