Publications

• Clément Aubert, Iain Phillips and Irek Ulidowski. Independence and Causality in the Reversible Concurrent Setting. Proceedings of Seventeenth International Conference on Reversible Computation. Lecture Notes in Computer Science, Springer 2025. Accepted.
• Clément Aubert, Iain Phillips and Irek Ulidowski. Dependence and Independence for Reversible Process Calculi. arXiv:2410.14699 [cs.LO], 2024.
• Ivan Lanese, Iain Phillips and Irek Ulidowski. An axiomatic theory for reversible computation. ACM Transactions on Computational Logic, volume 25, 2024, pages 1-40. doi:10.1145/3648474. Spiral
• Ivan Lanese, Iain Phillips and Irek Ulidowski. An axiomatic theory for reversible computation. arXiv:2307.13360 [cs.LO], 2023.
• Robert Glück, Ivan Lanese, Claudio Antares Mezzina, Jaroslaw A. Miszczak, Iain Phillips, Irek Ulidowski and German Vidal. Towards a Taxonomy for Reversible Computation Approaches. Proceedings of Fifteenth International Conference on Reversible Computation. Lecture Notes in Computer Science, volume 13960, pages 24-39, Springer 2023. doi:10.1007/978-3-031-38100-3_3 Spiral
• Eva Graversen, Iain Phillips and Nobuko Yoshida. Event structures for the reversible early internal pi-calculus. Journal of Logical and Algebraic Methods in Programming, volume 124, 2022, 100720. doi:10.1016/j.jlamp.2021.100720 Spiral
• Ivan Lanese, Iain Phillips. Forward-Reverse Observational Equivalences in CCSK. Proceedings of Thirteenth International Conference on Reversible Computation. Lecture Notes in Computer Science, volume 12805, pages 126-143, Springer 2021. doi:10.1007/978-3-030-79837-6_8 Spiral
• Eva Graversen, Iain Phillips and Nobuko Yoshida. Event structure semantics of (controlled) reversible CCS. Journal of Logical and Algebraic Methods in Programming, volume 121, 2021, 100686. doi:10.1016/j.jlamp.2021.100686 Spiral
• Doriana Medić, Claudio Antares Mezzina, Iain Phillips and Nobuko Yoshida. A Parametric Framework for Reversible π-Calculi. Information and Computation, volume 275, 2020, 104644. doi:10.1016/j.ic.2020.104644 Spiral
• Eva Graversen, Iain Phillips and Nobuko Yoshida. Event structures for the reversible early internal pi-calculus. Proceedings of Twelfth International Conference on Reversible Computation. Lecture Notes in Computer Science, volume 12227, pages 71-90, Springer 2020. doi:10.1007/978-3-030-52482-1_4 Spiral
• Doriana Medić, Claudio Antares Mezzina, Iain Phillips and Nobuko Yoshida. Towards a formal account for software transactional memory. Proceedings of Twelfth International Conference on Reversible Computation. Lecture Notes in Computer Science, volume 12227, pages 255-263, Springer 2020. doi:10.1007/978-3-030-52482-1_16 Spiral
• Hernán Melgratti, Claudio Antares Mezzina, Iain Phillips, G. Michele Pinna, Irek Ulidowski. Reversible Occurrence Nets and Causal Reversible Event Structures. Proceedings of Twelfth International Conference on Reversible Computation. Lecture Notes in Computer Science, volume 12227, pages 35-53, Springer 2020. doi:10.1007/978-3-030-52482-1_2 Spiral
• Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Łukasz Mikulski, Rajagopal Nagarajan, Iain Phillips, G. Michele Pinna, Luca Prigioniero, Irek Ulidowski and German Vidal. Foundations of Reversible Computation. In: Reversible Computation: Theory and Applications. Lecture Notes in Computer Science, volume 12070, pages 1-40, Springer 2020. doi:10.1007/978-3-030-47361-7_1 Spiral
• Ivan Lanese, Iain Phillips and Irek Ulidowski. An axiomatic approach to reversible computation. Proceedings of 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2020). Lecture Notes in Computer Science, volume 12077, pages 442-461, Springer 2020. doi:10.1007/978-3-030-45231-5_23 Spiral
• Eva Graversen, Iain Phillips and Nobuko Yoshida. Event structures for the reversible early internal pi-calculus. arXiv:2004.01211 [cs.FL], 2020.
• Hernán Melgratti, Claudio Antares Mezzina, Iain Phillips, G. Michele Pinna, Irek Ulidowski. Reversible Causal Nets and Reversible Event Structures. arXiv:1910.10987 [cs.LO], 2019.
• Eva Graversen, Iain Phillips and Nobuko Yoshida. Towards a Categorical Representation of Reversible Event Structures. Journal of Logical and Algebraic Methods in Programming, volume 104, pages 16-59, 2019. doi:10.1016/j.jlamp.2019.01.001 Spiral
• Irek Ulidowski, Iain Phillips and Shoji Yuen. Reversing event structures. New Generation Computing, volume 36, pages 281-306, 2018. doi:10.1007/s00354-018-0040-8 Spiral
• Doriana Medić, Claudio Antares Mezzina, Iain Phillips and Nobuko Yoshida. A Parametric Framework for Reversible π-Calculi. Proceedings of EXPRESS/SOS 2018. EPTCS volume 276, pages 87-103, 2018. doi:10.4204/EPTCS.276.8 Spiral
• Doriana Medić, Claudio Antares Mezzina, Iain Phillips and Nobuko Yoshida. A Parametric Framework for Reversible π-Calculi. arXiv:1807.11800 [cs.LO] 2018.
• Eva Graversen, Iain Phillips and Nobuko Yoshida. Event structure semantics of (controlled) reversible CCS. Proceedings of Tenth International Conference on Reversible Computation. Lecture Notes in Computer Science, volume 11106, pages 102-122, Springer 2018. doi:10.1007/978-3-319-99498-7_7 Spiral
• Iain Phillips and Hafizur Rahaman, editors. Proceedings, Reversible Computation - 9th International Conference, RC 2017, Kolkata, India, July 6-7, 2017. Lecture Notes in Computer Science, volume 10301, Springer 2017. doi:10.1007/978-3-319-59936-6
• Eva Graversen, Iain Phillips and Nobuko Yoshida. Towards a Categorical Representation of Reversible Event Structures. Proceedings of Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software (PLACES 2017). EPTCS volume 246, pages 49-60, 2017. doi:10.4204/EPTCS.246.9 Spiral
• Iain Phillips and Irek Ulidowski. Reversibility and Asymmetric Conflict in Event Structures. Journal of Logical and Algebraic Methods in Programming, volume 84, pages 781-805, 2015. doi:10.1016/j.jlamp.2015.07.004 Spiral
• Tommi Pesu and Iain Phillips. Real-time Methods in Reversible Computation. Proceedings of Seventh International Conference on Reversible Computation. Lecture Notes in Computer Science, volume 9138, pages 45-59. Springer-Verlag, 2015. doi:10.1007/978-3-319-20860-2_3 Spiral
• Irek Ulidowski, Iain Phillips and Shoji Yuen. Concurrency and Reversibility. Proceedings of Sixth International Conference on Reversible Computation. Lecture Notes in Computer Science, volume 8507, pages 1-14. Springer-Verlag, 2014. doi:10.1007/978-3-319-08494-7_1
• Iain Phillips and Irek Ulidowski. Event Identifier Logic. Mathematical Structures in Computer Science, volume 24, e240204, 2014. © Cambridge University Press. doi:10.1017/S0960129513000510
• Iain Phillips and Irek Ulidowski. Reversibility and Asymmetric Conflict in Event Structures. Proceedings of 24th International Conference on Concurrency Theory, CONCUR 2013. Lecture Notes in Computer Science, volume 8052, pages 303-318. Springer-Verlag, 2013. doi:10.1007/978-3-642-40184-8_22
• Iain Phillips, Irek Ulidowski and Shoji Yuen. Modelling of Bonding with Processes and Events. Proceedings of Fifth International Conference on Reversible Computation. Lecture Notes in Computer Science volume 7948, pages 141-154. Springer-Verlag, 2013. doi:10.1007/978-3-642-38986-3_12
• Iain Phillips, Irek Ulidowski and Shoji Yuen. A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway. Proceedings of Fourth International Workshop on Reversible Computation. Lecture Notes in Computer Science volume 7581, pages 218-232. Springer-Verlag, 2013. doi:10.1007/978-3-642-36315-3_18
• Iain Phillips and Irek Ulidowski. A Hierarchy of Reverse Bisimulations on Stable Configuration Structures. Mathematical Structures in Computer Science, volume 22, pages 333-372, 2012. © Cambridge University Press. doi:10.1017/S0960129511000429
• Iain Phillips and Irek Ulidowski. A Logic with Reverse Modalities for History-preserving Bisimulations. Proceedings, 18th International Workshop on Expressiveness of Concurrency, EXPRESS'11, Aachen, Germany, September 2011. EPTCS, volume 64, 2011, pp. 104-118. doi:10.4204/EPTCS.64.8
• Iain Phillips and Irek Ulidowski. Reverse Bisimulations on Stable Configuration Structures. Proceedings, SOS 2009. EPTCS, volume 18, 2010, pp. 62-76. doi:10.4204/EPTCS.18.5
• MohammadReza Mousavi, Iain Phillips, Michel Reniers and Irek Ulidowski. Semantics and expressiveness of ordered SOS. Information and Computation, volume 207(2), pages 85-119, 2009. doi:10.1016/j.ic.2007.11.008
• Iain Phillips. CCS with Priority Guards. Journal of Logic and Algebraic Programming, volume 75(1), pages 139-165, 2008. doi:10.1016/j.jlap.2007.06.005
• Bjřrn Haagensen, Sergio Maffeis and Iain Phillips. Matching systems for concurrent calculi. Proceedings, 14th International Workshop on Expressiveness of Concurrency, EXPRESS'07, Lisbon, Portugal, September 2007. ENTCS, Volume 194, issue 2, pages 85-99, 2008. doi:10.1016/j.entcs.2007.11.004 Preliminary Proceedings: IT University of Copenhagen Technical Report TR-2007-100.
• Iain Phillips and Maria Grazia Vigliotti. Symmetric Electoral Systems for Ambient Calculi. Information and Computation, Volume 206(1), pages 34-72, 2008. doi: 10.1016/j.ic.2007.08.005
• Maria Grazia Vigliotti, Iain Phillips and Catuscia Palamidessi. Tutorial on separation results in process calculi via leader election problems. Theoretical Computer Science, Volume 388(1-3), pages 267-289, 2007. doi:10.1016/j.tcs.2007.09.001
• Jos Baeten and Iain Phillips, editors. Special issue of Theoretical Computer Science devoted to selected papers from the 12th International Workshop on Expressiveness of Concurrency, EXPRESS'05, San Francisco, USA, 27 August 2005. Volume 386(3), 2007. doi:10.1016/j.tcs.2007.07.006
• Iain Phillips and Irek Ulidowski. Reversibility and models for concurrency. Proceedings of SOS 2007. ENTCS, Volume 192, issue 1, pages 93-108, 2007. doi: 10.1016/j.entcs.2007.08.018
• Iain Phillips and Irek Ulidowski. Reversing Algebraic Process Calculi. Journal of Logic and Algebraic Programming, Volume 73(1-2), pages 70-96, September-October 2007. doi:10.1016/j.jlap.2006.11.002 bibtex
• Roberto Amadio and Iain Phillips, editors. Proceedings, 13th International Workshop on Expressiveness of Concurrency, EXPRESS'06, Bonn, Germany, 26 August 2006. ENTCS, Volume 175, issue 3, pages 1-2, June 2007. doi:10.1016/j.entcs.2007.04.010
• MohammadReza Mousavi, Iain Phillips, Michel Reniers and Irek Ulidowski. Semantics and expressiveness of ordered SOS. Technical report 07-07, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 2007.
• MohammadReza Mousavi, Iain Phillips, Michel Reniers and Irek Ulidowski. The meaning of ordered SOS. Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06). Lecture Notes in Computer Science 4337, pages 333-344, 2006. © Springer-Verlag. doi:10.1007/11944836_31
• Maria Grazia Vigliotti, Iain Phillips and Catuscia Palamidessi. Separation results via leader election problems. Formal Methods for Components and Objects 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures. Lecture Notes in Computer Science 4111, pages 172-194, 2006. © Springer-Verlag. doi:10.1007/11804192_9
• Iain Phillips and Irek Ulidowski. Operational semantics of reversibility in process algebra. In L. Aceto and A.D. Gordon, editors, Proceedings of the Workshop "Essays on Algebraic Process Calculi" (APC 25), Bertinoro, Italy, 01-05 August 2005. ENTCS, Volume 162, pages 281-286, 2006. doi:10.1016/j.entcs.2005.12.095
• Roberto Amadio and Iain Phillips, editors. Preliminary Proceedings, 13th International Workshop on Expressiveness of Concurrency, EXPRESS'06, Bonn, Germany, 26 August 2006. Technical Report 2006/10, Department of Computing, Imperial College London, 2006.
• Jos Baeten and Iain Phillips, editors. Proceedings, 12th International Workshop on Expressiveness of Concurrency, EXPRESS'05, San Francisco, USA, 27 August 2005. ENTCS, Volume 154, Issue 3, 2006. doi:10.1016/j.entcs.2006.05.002
• Iain Phillips and Maria Grazia Vigliotti. Leader election in rings of ambient processes. Theoretical Computer Science. Vol. 356, No. 3, pages 468-494, 2006. doi:10.1016/j.tcs.2006.02.004 bibtex
• Iain Phillips and Irek Ulidowski. Reversing Algebraic Process Calculi. Proceedings of FOSSACS 2006. Lecture Notes in Computer Science 3921, pages 246-260, 2006. © Springer-Verlag. doi:10.1007/11690634_17
• Iain Phillips and Irek Ulidowski. Reversing Algebraic Process Calculi. Technical Report CS-06-01, University of Leicester, 2006.
• Jos Baeten and Iain Phillips, editors. Preliminary Proceedings, 12th International Workshop on Expressiveness of Concurrency, EXPRESS'05, San Francisco, USA, 27 August 2005. Technical Report CS-05-20, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 2005.
• Iain Phillips and Irek Ulidowski. Operational semantics of reversibility in process algebra. In L. Aceto and A.D. Gordon, editors, Short Contributions from the Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond (PA '05), Bertinoro, Forlì, Italy, August 1-5, 2005, BRICS Notes Series NS-05-3, pages 200-203, 2005.
• Iain Phillips and Maria Grazia Vigliotti. Leader election in rings of ambient processes. Proceedings of Express: Workshop on Expressiveness in Concurrency, London, August 2004. ENTCS, Volume 128, Issue 2, pages 185-199, 2005. doi:10.1016/j.entcs.2004.11.036
• Sergio Maffeis and Iain Phillips. On the Computational Strength of Pure Ambient Calculi. Theoretical Computer Science, Vol. 330, No. 3, pages 501-551, 2005. doi:10.1016/j.tcs.2004.10.007 bibtex
• Iain Phillips and Maria Grazia Vigliotti. Leader election in rings of ambient processes. Technical Report 2004/10, Department of Computing, Imperial College, December 2004.
• Iain Phillips and Maria Grazia Vigliotti. Electoral Systems in Ambient Calculi. Proceedings of FoSSaCS 2004, Lecture Notes in Computer Science 2987, pages 408-422, 2004. © Springer-Verlag. doi:10.1007/978-3-540-24727-2_29 bibtex
• Sergio Maffeis and Iain Phillips. On the Computational Strength of Pure Ambient Calculi. Proceedings of Express: Workshop on Expressiveness in Concurrency, Marseilles, September 2003. ENTCS, Volume 96, pages 29-49, 2004. doi:10.1016/j.entcs.2004.04.020
• Sergio Maffeis and Iain Phillips. On the Computational Strength of Pure Ambient Calculi. Technical Report 2003/10, Department of Computing, Imperial College, October 2003 (revised December 2003).
• Irek Ulidowski and Iain Phillips. Ordered SOS Process Languages for Branching and Eager Bisimulations, Information and Computation, Vol. 178, No. 1, Oct 2002, pages 180-213. doi:10.1006/inco.2002.3161 bibtex (Technical Report 1999/15, Department of Mathematics and Computer Science, University of Leicester. 1999.)
• Maria Grazia Vigliotti and Iain Phillips. Barbs and Congruences for Safe Mobile Ambients. Proceedings of F-WAN: Workshop on Foundations of Wide-area Network Computing, Malaga, July 2002. ENTCS, Volume 66, Issue 3, pages 37-51, September 2002. doi:10.1016/S1571-0661(04)80415-8 bibtex
• Iain Phillips and Maria Grazia Vigliotti. On Reduction Semantics for the Push and Pull Ambient Calculus. Proceedings of IFIP International Conference on Theoretical Computer Science (TCS 2002), IFIP 17th World Computer Congress, August 2002, Montreal. Kluwer, 2002. doi:10.1007/978-0-387-35608-2_45 bibtex
• Iain Phillips. CCS with Priority Guards. In: Concur 2001, Lecture Notes in Computer Science 2154, pages 305-320, 2001. © Springer-Verlag. doi:10.1007/3-540-44685-0_21 bibtex
• Iain Phillips. CCS with Priority Guards Technical Report, Department of Computing, Imperial College, November 2000.
• Irek Ulidowski and Iain Phillips. Formats of Ordered SOS Rules with Silent Actions, in: TAPSOFT '97: Theory and Practice of Software Development, CAAP/FASE, Lille, April 1997, Lecture Notes in Computer Science 1214, Springer-Verlag, 1997, pages 297-308. doi:10.1007/BFb0030605 bibtex
• Iain Phillips and Irek Ulidowski. Ordered SOS Rules and Weak Bisimulation, in: A. Edalat, S. Jourdan and G. McCusker, eds., Proceedings of the Third Imperial College Department of Computing Workshop on Theory and Formal Methods, Imperial College Press, 1996, pages 300-311.
• Marta Kwiatkowska and Iain Phillips. Possible and Guaranteed Concurrency in CSP, in: Proceedings of the International Workshop on Structures in Concurrency Theory (STRICT), May 1995, Berlin-Mitte, Workshops in Computing, Springer-Verlag, 1995, pages 220-235. doi:10.1007/978-1-4471-3078-9_15 bibtex
• Iain Phillips. A Note on Expressiveness of Process Algebra, in: G.L. Burn, S. Gay and M.D. Ryan, eds., Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods, Workshops in Computing, Springer-Verlag, 1993, pages 260-264. doi:10.1007/978-1-4471-3503-6_20 bibtex
• Marta Kwiatkowska and Iain Phillips. Concurrency and Conflict in CSP, in: G.L. Burn, S. Gay and M.D. Ryan, eds., Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods, Workshops in Computing, Springer-Verlag, 1993, pages 209-225. doi:10.1007/978-1-4471-3503-6_16
• Iain Phillips. Recursion Theory, in: S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, eds., Handbook of Logic in Computer Science, Volume 1, Oxford University Press, 1992, pages 79-187. bibtex
• Iain Phillips. Refusal Testing, Theoretical Computer Science, Volume 50, 1987, pages 241- 284. doi:10.1016/0304-3975(87)90117-4 bibtex
• Iain Phillips. Refusal Testing, in: L. Kott, ed., Proceedings of 13th ICALP, Lecture Notes in Computer Science 226, Springer-Verlag, 1986, pages 304-313. doi:10.1007/3-540-16761-7_80
• Evangelos Kranakis and Iain Phillips. Partitions and Homogeneous Sets for Admissible Ordinals, in: G.H. Müller and M.M. Richter, eds., Models and Sets, Proceedings of the Logic Colloquium held in Aachen, July 18-23, 1983, Part I, Lecture Notes in Mathematics 1103, Springer-Verlag, 1984, pages 235-260. doi:10.1007/BFb0099389 bibtex
• Iain Phillips. Definability theory for Σ_n-admissible ordinals. DPhil Thesis, University of Oxford, 1983. Catalogue

Unpublished

• Python Crib-sheet April 2000.
• The Department of Computing Timetable Problem December 1999.
• Turing Machines in the Pi Calculus , Note, November 1996.
• Approaches to Priority in Process Algebra. Draft presented at the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, Cambridge 1994.
• Lecture notes on Discrete Mathematics for first year Computer Science students. Revised October 1994.
• Stable and Timed Formats for Process Algebra (with Irek Ulidowski), 1994.
• CCS with Broadcast Stability. Draft. 1987, revised 1992-3.