Publications
67 results found
Phillips L, Vigliotti MG, 2002, On reduction semantics for the push and pull ambient calculus, 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002) held in conjunction with the 17th World Computer Congress, Publisher: KLUWER ACADEMIC PUBLISHERS, Pages: 550-562, ISSN: 1571-5736
- Author Web Link
- Cite
- Citations: 10
Phillips I, 2001, CCS with priority guards, Berlin, Concurrency theory; CONCUR 2001, Publisher: Springer, Pages: 305-320, ISSN: 0302-9743
Phillips I, 2000, CCS with priority guards, Departmental Technical Report: 2000/12, Publisher: Department of Computing, Imperial College London
It has long been recognised that ordinary process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of "priority guards" to the summation operator of Milner's process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assigned fixed levels, so that the same action can have different priority depending where it appears in a program. An important feature is that, unlike in other unstratified accounts of priority in CCS (such as that of Camilleri and Winskel), we can treat inputs and outputs symmetrically. We introduce the new calculus, give examples, develop its theory (including bisimulation, equational laws and logics), and compare it with existing approaches.
Ulidowski I, Phillips I, 1997, Formats of ordered SOS rules with silent actions, Pages: 297-308, ISSN: 0302-9743
We present a general and uniform method for defining structural operational semantics (SOS) of process algebra operators by traditional Plotkin-style rules equipped with an ordering, the new feature which states the order of application of rules when deriving transitions of process terms. Our method allows to represent negative premises and copying in the presence of silent actions. We identify a number of genera] formats of unordered and ordered rules with silent actions and show that divergence sensitive branching and weak bisimulation relations are preserved by all operators in the relevant formats. A comparison with the existing formats for branching and weak bisimulations shows that our formats are more general.
Phillips I, Ulidowski I, 1996, Ordered SOS rules and weak bisimulation, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 300-311
- Author Web Link
- Cite
- Citations: 2
PHILLIPS I, 1987, REFUSAL TESTING, THEORETICAL COMPUTER SCIENCE, Vol: 50, Pages: 241-284, ISSN: 0304-3975
- Author Web Link
- Cite
- Citations: 91
PHILLIPS I, 1986, REFUSAL TESTING, LECTURE NOTES IN COMPUTER SCIENCE, Vol: 226, Pages: 304-313, ISSN: 0302-9743
- Author Web Link
- Cite
- Citations: 7
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.