Publications
67 results found
Mousavi M, Phillips I, Reniers M, et al., 2009, Semantics and expressiveness of ordered SOS, Information and Computation
Phillips L, Vigliotti MG, 2008, Symmetric electoral systems for ambient calculi, INFORMATION AND COMPUTATION, Vol: 206, Pages: 34-72, ISSN: 0890-5401
- Author Web Link
- Cite
- Citations: 12
Phillips, I C C, 2008, CCS with Priority Guards, Journal of Logic and Algebraic Programming
Haagensen B, Maffeis S, Phillips I, 2008, Matching systems for concurrent calculi, 14th International Workshop on Expressiveness in Concurrency (Express'07), Publisher: Elsevier, Pages: 85-99
Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and investigate matching systems for CCS, the pi-calculus and Mobile Ambients. We show among other results that the asynchronous pi-calculus with matching cannot be encoded (under certain conditions) in CCS with polyadic synchronisation of all finite levels.
Vigliotti MG, Phillips I, Palamidessi C, 2007, Tutorial on separation results in process calculi via leader election problems, THEORETICAL COMPUTER SCIENCE, Vol: 388, Pages: 267-289, ISSN: 0304-3975
- Author Web Link
- Cite
- Citations: 18
Baeten JCM, Phillips ICC, 2007, Preface, Publisher: ELSEVIER SCIENCE BV, Pages: 167-168
, 2007, Selected papers from the 12th International Workshop on Expressiveness of Concurrency, EXPRESS'05, San Francisco, USA, 27 August 2005, Theoretical Computer Science, Vol: 386
Phillips I, Ulidowski I, 2007, Reversibility and models for concurrency, International Workshop on Structural Operational Semantics 2007, Publisher: Elsevier, Pages: 93-108
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS and CCSK were developed and general techniques for reversing other process operators were proposed. The paper shows that the notion of reversibility can bridge the gap between some interleaving models and non-interleaving models of concurrency, and makes them interchangeable. We prove that transition systems associated with reversible process algebras are equivalent as models to labelled prime event structures. Furthermore, we show that forward-reverse bisimulation corresponds to hereditary history-preserving bisimulation in the setting with no auto-concurrency and no auto-causation.
, 2007, 13th International Workshop on Expressiveness in Concurrency (EXPRESS'06), Publisher: Elsevier
Cont R, Fouque J-P, Lapeyre B, 2007, Preface, Publisher: EDP Sciences, Pages: 1-2
Phillips, I C C, Ulidowski I, 2007, Reversing algebraic process calculi, Journal of Logic and Algebraic Programming, Vol: 73, Pages: 70-96, ISSN: 1567-8326
, 2006, 12th International Workshop on Expressiveness in Concurrency (EXPRESS'05), Electronic Notes in Theoretical Computer Science, Publisher: Elsevier
Phillips I, Vigliotti M, 2006, Leader election in rings of ambient processes, 11th International Workshop on Expressiveness in Concurrency, Publisher: Elsevier, Pages: 468-494, ISSN: 0302-9743
Palamidessi has shown that the pi-calculus with mixed choice is powerful enough to solve the leader election problem on a symmetric ring of processes. We show that this is also possible in the calculus of Mobile Ambients (MA), without using communication or restriction. Following Palamidessi's methods, we deduce that there is no encoding satisfying certain conditions from MA into CCS. We also show that the calculus of Boxed Ambients is more expressive than its communication-free fragment.
Vigliotti MG, Phillips I, Palamidessi C, 2006, Separation results via leader election problems, 4th International Symposium on Formal Methods for Components and Objects, Publisher: SPRINGER-VERLAG BERLIN, Pages: 172-194, ISSN: 0302-9743
- Author Web Link
- Cite
- Citations: 2
Mousavi M, Phillips I, Reniers M, et al., 2006, The meaning of ordered SOS, 26th Conference on Foundations of Software Technology and Theoretical Computer Science, Publisher: Springer-Verlag
Phillips I, Ulidowski I, 2006, Operational Semantics of Reversibility in Process Algebra, Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond (PA '05), Bertinoro, Forli, Italy, August 1-5, 2005
Phillips I, Ulidowski I, 2006, Reversing algebraic process calculi, Berlin, 9th International Conference on Foundations of Software Science and Computation Structures, 25 - 31 March 2006, Vienna, AUSTRIA, Publisher: Springer-Verlag, Pages: 246-260
Phillips I, Vigliotti MG, 2005, Leader election in rings of ambient processes, Pages: 185-199, ISSN: 1571-0661
Palamidessi has shown that the π-calculus with mixed choice is powerful enough to solve the leader election problem on a symmetric ring of processes. We show that this is also possible in the calculus of Mobile Ambients (MA), without using communication or restriction. Following Palamidessi's methods, we deduce that there is no encoding satisfying certain conditions from MA into CCS. We also show that the calculus of Boxed Ambients is more expressive than its communication-free fragment. © 2005 Elsevier B.V. All rights reserved.
Maffeis S, Phillips L, 2005, On the computational strength of pure ambient calculi, 10th International Workshop on Expressiveness in Concurrency (EXPRESS 2003), Publisher: ELSEVIER, Pages: 501-551, ISSN: 0304-3975
- Author Web Link
- Cite
- Citations: 21
Phillips I, Vigliotti MG, 2004, Leader election in rings of ambient processes, Departmental Technical Report: 04/10, Publisher: Department of Computing, Imperial College London, 04/10
Palamidessi has shown that the ¼-calculus with mixed choice is powerful enoughto solve the leader election problem on a symmetric ring of processes. We showthat this is also possible in the calculus of Mobile Ambients (MA), without usingcommunication or restriction. Following Palamidessi's methods, we deduce thatthere is no encoding satisfying certain conditions from MA into CCS. We also showthat the calculus of Boxed Ambients is more expressive than its communication-freefragment.
Phillips, I C C, Vigliotti M G, 2004, Electoral systems in ambient calculi, Berlin, 7th international conference on foundations of software science and computation structures, Publisher: Springer-Verlag, Pages: 408-422
Maffeis S, Phillips I, 2004, On the computational strength of pure ambient calculi, Electronic Notes in Theoretical Computer Science, Vol: 96, Pages: 29-49, ISSN: 1571-0661
Phillips I, Vigliotti MG, 2004, Electoral systems in ambient calculi, 7th International Conference on Foundations of Software Science and Computation Structures, Publisher: SPRINGER-VERLAG BERLIN, Pages: 408-422, ISSN: 0302-9743
- Author Web Link
- Cite
- Citations: 15
Magueijo J, 2004, Preface, The complete idiot's guide to Albert Einstein, Publisher: Penguin
Maffeis S, Phillips I, 2004, On the computational strength of pure ambient calculi, Pages: 29-49, ISSN: 1571-0661
Maffeis S, Phillips I, 2003, On the computational strength of pure ambient calculi, Departmental technical report (Imperial College of Science, Technology and Medicine. Department of Computing) ;, Publisher: Imperial College of Science, Technology and Medicine, Department of Computing, 10
Ulidowski I, Phillips I, 2002, Ordered SOS process languages for branching and eager bisimulations, INFORMATION AND COMPUTATION, Vol: 178, Pages: 180-213, ISSN: 0890-5401
- Author Web Link
- Cite
- Citations: 26
Ulidowski I, Phillips I, 2002, Ordered SOS Process Languages for Branching and Eager Bisimulations, Information and Computation, Vol: 178, Pages: 180-213, ISSN: 0890-5401
Vigliotti MG, Phillips I, 2002, Barbs and congruences for safe mobile ambients, Proceedings of F-WAN: workshop on foundations of wide-area network computing, Malaga, July 2002
Phillips I, Vigliotti MG, 2002, On reduction semantics for the push and pull ambient calculus, Norwell, 2nd IFIP international conference on theoretical computer science (TCS 2002) held in conjunction with the 17th world computer congress, Montreal, Canada, 2002, Publisher: Kluwer Academic Publishers, Pages: 550-562
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.