Publications
-
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.
A Hierarchy of Reverse Bisimulations on Stable Configuration Structures.
Accepted by Mathematical Structures in Computer Science.
-
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.
-
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 (for whole volume):10.1007/b95995
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.
-
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.
bibtex
-
Iain Phillips.
CCS with Priority Guards.
In: Concur 2001,
Lecture Notes in Computer Science
2154, pages 305-320, 2001.
© Springer-Verlag.
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.
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.
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.
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.
-
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.
-
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
Unpublished