Iain Phillips
Iain Phillips
Senior Lecturer, Department of Computing, Imperial College London
Verifierad e-postadress på imperial.ac.uk - Startsida
TitelCiteras avÅr
Refusal testing
I Phillips
Theoretical Computer Science 50 (3), 241-284, 1987
2291987
Reversing algebraic process calculi
I Phillips, I Ulidowski
The Journal of Logic and Algebraic Programming 73 (1-2), 70-96, 2007
972007
On the computational strength of pure ambient calculi
S Maffeis, I Phillips
Theoretical Computer Science 330 (3), 501-551, 2005
552005
A reversible process calculus and the modelling of the ERK signalling pathway
I Phillips, I Ulidowski, S Yuen
International Workshop on Reversible Computation, 218-232, 2012
442012
Ordered SOS process languages for branching and eager bisimulations
I Ulidowski, I Phillips
Information and Computation 178 (1), 180-213, 2002
432002
Reversibility and models for concurrency
I Phillips, I Ulidowski
Electronic Notes in Theoretical Computer Science 192 (1), 93-108, 2007
382007
On the computational strength of pure ambient calculi
S Maffeis, I Phillips
Theoretical Computer Science 330 (3), 501-551, 2005
372005
On reduction semantics for the push and pull ambient calculus
I Phillips, MG Vigliotti
Foundations of Information Technology in the Era of Network and Mobile …, 2002
342002
Electoral systems in ambient calculi
I Phillips, MG Vigliotti
International Conference on Foundations of Software Science and Computation …, 2004
312004
Reversibility and asymmetric conflict in event structures
I Phillips, I Ulidowski
Journal of Logical and Algebraic Methods in Programming 84 (6), 781-805, 2015
302015
A logic with reverse modalities for history-preserving bisimulations
I Phillips, I Ulidowski
arXiv preprint arXiv:1108.4470, 2011
302011
CCS with priority guards
I Phillips
The Journal of Logic and Algebraic Programming 75 (1), 139-165, 2008
292008
Reversing algebraic process calculi
I Phillips, I Ulidowski
International Conference on Foundations of Software Science and Computation …, 2006
292006
CCS with priority guards
I Phillips
International Conference on Concurrency Theory, 305-320, 2001
272001
Tutorial on separation results in process calculi via leader election problems
MG Vigliotti, I Phillips, C Palamidessi
Theoretical Computer Science 388 (1-3), 267-289, 2007
242007
Concurrency and reversibility
I Ulidowski, I Phillips, S Yuen
International Conference on Reversible Computation, 1-14, 2014
202014
A hierarchy of reverse bisimulations on stable configuration structures
I Phillips, I Ulidowski
Mathematical Structures in Computer Science 22 (2), 333-372, 2012
202012
Leader election in rings of ambient processes
I Phillips, MG Vigliotti
Theoretical Computer Science 356 (3), 468-494, 2006
202006
Formats of ordered SOS rules with silent actions
I Ulidowski, I Phillips
Colloquium on Trees in Algebra and Programming, 297-308, 1997
201997
Modelling of bonding with processes and events
I Phillips, I Ulidowski, S Yuen
International Conference on Reversible Computation, 141-154, 2013
182013
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20