References

  1. L. Aceto (1994): GSOS and Finite Labelled Transition Systems. Theor. Comput. Sci. 131(1), pp. 181–195, doi:10.1016/0304-3975(94)90094-9.
  2. A. Avizienis, J.-C. Laprie, B. Randell & C.E. Landwehr (2004): Basic Concepts and Taxonomy of Dependable and Secure Computing. IEEE Trans. Dependable Sec. Comput. 1(1), pp. 11–33, doi:10.1109/TDSC.2004.2.
  3. G. Bacci, V. Danos & O. Kammar (2011): On the Statistical Thermodynamics of Reversible Communicating Processes. In: CALCO 2011, LNCS 6859. Springer, pp. 1–18, doi:10.1007/978-3-642-22944-2_1.
  4. J. Bengtson, M. Johansson, J. Parrow & B. Victor (2011): Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods in Computer Science 7(1), doi:10.2168/LMCS-7(1:11)2011.
  5. C.H. Bennett (1973): Logical Reversibility of Computation. IBM Journal of Research and Development 17(6), doi:10.1147/rd.176.0525.
  6. M. Boreale & D. Sangiorgi (1998): A Fully Abstract Semantics for Causality in the π-Calculus. Acta Inf. 35(5), pp. 353–400, doi:10.1007/s002360050124.
  7. G. Boudol & I. Castellani (1988): Permutation of transitions: An event structure semantics for CCS and SCCS. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354. Springer, pp. 411–427, doi:10.1007/BFb0013028.
  8. N. Busi & R. Gorrieri (1995): A Petri Net Semantics for pi-Calculus. In: CONCUR Philadelphia, PA, USA, August 21-24, 1995, Proceedings, pp. 145–159, doi:10.1007/3-540-60218-6_11.
  9. S. Crafa, D. Varacca & N. Yoshida (2012): Event Structure Semantics of Parallel Extrusion in the Pi-Calculus. In: FOSSACS 2012, LNCS 7213. Springer, pp. 225–239, doi:10.1007/978-3-642-28729-9_15.
  10. I.D. Cristescu, J. Krivine & D. Varacca (2013): A Compositional Semantics for the Reversible π-Calculus. In: LICS 2013, pp. 388–397, doi:10.1109/LICS.2013.45.
  11. I.D. Cristescu, J. Krivine & D. Varacca (2015): Rigid Families for CCS and the π-calculus. In: ICTAC, LNCS 9399. Springer, pp. 223–240, doi:10.1007/978-3-319-25150-9_14.
  12. V. Danos & J. Krivine (2004): Reversible Communicating Systems. In: CONCUR 2004, LNCS 3170. Springer, pp. 292–307, doi:10.1007/978-3-540-28644-8_19.
  13. V. Danos & J. Krivine (2005): Transactions in RCCS. In: CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, pp. 398–412, doi:10.1007/11539452_31.
  14. V. Danos & J. Krivine (2007): Formal Molecular Biology Done in CCS-R. Electr. Notes Theor. Comput. Sci. 180(3), pp. 31–49, doi:10.1016/j.entcs.2004.01.040.
  15. P. Degano & C. Priami (1999): Non-Interleaving Semantics for Mobile Processes. Theor. Comput. Sci. 216(1-2), pp. 237–270, doi:10.1016/S0304-3975(99)80003-6.
  16. E. Giachino, I. Lanese & C.A. Mezzina (2014): Causal-Consistent Reversible Debugging. In: FASE 2014, LNCS 8411. Springer, pp. 370–384, doi:10.1007/978-3-642-54804-8_26.
  17. J. Grattage (2005): A Functional Quantum Programming Language. In: LICS. IEEE Computer Society, Washington, DC, USA, pp. 249–258, doi:10.1109/LICS.2005.1.
  18. T.T. Hildebrandt, C. Johansen & H. Normann (2017): A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus. In: LATA, LNCS 10168, pp. 51–63, doi:10.1007/978-3-319-53733-7_3.
  19. I. Lanese, M. Lienhardt, C.A. Mezzina, A. Schmitt & J.-B. Stefani (2013): Concurrent Flexible Reversibility. In: ESOP 2013, pp. 370–390, doi:10.1007/978-3-642-37036-6_21.
  20. I. Lanese, C.A. Mezzina & J.-B. Stefani (2016): Reversibility in the higher-order π-calculus. Theor. Comput. Sci. 625, pp. 25–84, doi:10.1016/j.tcs.2016.02.019.
  21. Jean-Jacques Lévy (1976): An Algebraic Interpretation of the λβK-Calculus; and an Application of a Labelled λ -Calculus. Theor. Comput. Sci. 2(1), pp. 97–114, doi:10.1016/0304-3975(76)90009-8.
  22. D. Medic & C.A. Mezzina (2016): Static VS Dynamic Reversibility in CCS. In: Reversible Computation RC 2016, LNCS 9720. Springer, pp. 36–51, doi:10.1007/978-3-319-40578-0_3.
  23. D. Medic & C.A. Mezzina (2017): Towards Parametric Causal Semantics in π-calculus. In: Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic, Naples, Italy, September 26-28., pp. 121–125.
  24. D. Medic, C.A. Mezzina, I.C.C. Phillips & N. Yoshida (2018): A Parametric Framework for Reversible π-Calculi. ArXiv e-prints. Available at http://arxiv.org/abs/1807.11800.
  25. R. Milner (1980): A Calculus of Communicating Systems. LNCS 92. Springer, doi:10.1007/3-540-10235-3.
  26. R. Perera & J. Cheney (2017): Proof-relevant π-calculus: a constructive account of concurrency and causality. Mathematical Structures in Computer Science, pp. 1–37, doi:10.1017/S096012951700010X.
  27. I.C.C. Phillips & I. Ulidowski (2007): Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1-2), pp. 70–96, doi:10.1016/j.jlap.2006.11.002.
  28. I.C.C. Phillips, I. Ulidowski & S. Yuen (2013): Modelling of Bonding with Processes and Events. In: Reversible Computation - RC 2013, LNCS 7948. Springer, pp. 141–154, doi:10.1007/978-3-642-38986-3_12.
  29. D. Sangiorgi & D. Walker (2001): The Pi-Calculus - a Theory of Mobile Processes. Cambridge Uni. Press.
  30. M.V. Zelkowitz (1973): Reversible Execution. Commun. ACM 16(9), pp. 566–, doi:10.1145/362342.362360.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org