Abstract
This paper investigates an extension of Milner's CCS with a conditional operator called unless [Cam90]. The agent \(\mathcal{K} \triangleright E\), pronounced E unless \(\mathcal{K}\), behaves as E unless the environment is ready to perform any action in the set \(\mathcal{K}\). This dependency on the set of actions the environment is ready to perform goes beyond that encountered in traditional CCS. Its expression is realised by an operational semantics in which transitions carry ready-sets (of the environment) as well as the normal action symbols from CCS. A notion of strong bisimulation is defined on conditional agents via this semantics. It is a congruence and satisfies new equational laws (including a new expansion law) which are shown to be complete for finite agents with the unless operator. The laws are conservative over agents of traditional CCS. The unless operator provides a rudimentary means of expressing bias (or priority) in the behaviour of agents; it is more expressive than the prisum operator presented in [CW91] and [Cam90].
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. Barrett. The semantics of priority and fairness in occam, April 1989. Proc. MFPS 5, New Orleans, USA.
J.C.M Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Technical Report CS-R8503, Center for Mathematics and Comp. Sci, Amsterdam, February 1985.
E. Best and M. Koutny. Partial order semantics of priority systems. Technical Report 6/90, Institute of Computer Science, University of Hildesheim, June 1990.
Juanito Camilleri. An operational semantics for occam. International Journal of Parallel Programming, 18(5), October 1989.
Juanito Camilleri. Priority in Process Calculi. PhD thesis, Department of Computer Science, University of Cambridge, October 1990.
R. Cleaveland and M. Hennessy. Priorities in process algebras. Technical Report 2/88, Department of Computer Science, University of Sussex, March 1988.
J. Camilleri and G. Winskel. CCS with Priority Choice. In Sixth Annual IEEE Symposium on Logic in Computer Science. Springer Verlag, July 1991.
R. Gerber and I. Lee. CCSR: A calculus for communicating shared resources. In J.C.M. Baeten and J.W.Klop, editors, ConCur'90, number 458 in LNCS, pages 263–277. Springer Verlag, 1990.
Jan Friso Groote. Transition system specifications with negative premises. In J.C.M. Baeten and J.W.Klop, editors, ConCur'90, number 458 in LNCS, pages 332–341. Springer Verlag, 1990.
Robin Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
S. Smolka and B. Steffen. Priority as extremal probability. In J.C.M. Baeten and J.W.Klop, editors, ConCur'90, number 458 in LNCS, pages 456–466. Springer Verlag, 1990.
C. Tofts. A synchronous calculus of relative frequency. In J.C.M. Baeten and J.W.Klop, editors, ConCur'90, number 458 in LNCS, pages 467–480. Springer Verlag, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Camilleri, J. (1991). A conditional operator for CCS. In: Baeten, J.C.M., Groote, J.F. (eds) CONCUR '91. CONCUR 1991. Lecture Notes in Computer Science, vol 527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54430-5_86
Download citation
DOI: https://doi.org/10.1007/3-540-54430-5_86
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54430-2
Online ISBN: 978-3-540-38357-4
eBook Packages: Springer Book Archive