Logic in Computer Science (LICS 1991)

Paper: CCS with priority choice (at LICS 1991)

Authors: Juanito Camilleri Glynn Winskel

Abstract

An extension of Milner's CCS with a priority choice operator called prisum is investigated. This operator is very similar to the PRIALT construct of Occam. The binary prisum operator only allows execution of its second component in the case in which the environment is not ready to allow the first component to proceed. This dependency on the set of actions the environment is ready to perform goes beyond that encountered in traditional CCS. Its expression leads to a novel operational semantics in which transitions carry read-sets (of the environment) as well as the normal action symbols from CCS. A notion of strong bisimulation is defined on agents with priority by means of 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 prisum. The laws are conservative over agents of traditional CCS

BibTeX

  @InProceedings{CamilleriWinskel-CCSwithprioritychoi,
    author = 	 {Juanito Camilleri and Glynn Winskel},
    title = 	 {CCS with priority choice},
    booktitle =  {Proceedings of the Sixth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1991},
    year =	 1991,
    editor =	 {Giles Kahn},
    month =	 {July}, 
    pages =      {246--255},
    location =   {Amsterdam, The Netherlands}, 
    publisher =	 {IEEE Computer Society Press}
  }