No label defined (Q3343420)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3878339
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3878339

      Statements

      0 references
      0 references
      1984
      0 references
      concurrency
      0 references
      transition systems
      0 references
      weak and strong fairness
      0 references
      Calculus of Communicating Systems
      0 references
      CCS
      0 references
      [For the entire collection see Zbl 0544.00022.] This paper examines the issue of weak and strong fairness. The framework is Milner's Calculus of Communicating Systems and the approach is operational. The problem addressed is that of giving finite rules for generating all and only the admissible execution sequences when fairness is assumed. This aim is achieved by defining two calculi, one for weak and the other for strong fairness. Both calculi are extensions of standard CCS; they do not involve random assignment or transformations. A distinguishing feature of the weakly fair calculus is that, unlike standard approaches which appeal to random assignment, it does not involve predictive choice. This is because there is a local characterization of weak fairness. [This paper is just an extended abstract; a more complete version, with the same title, has appeared as Techn. Rep., Dept. Comput. Sci., Univ. Edinburgh, CSR-167-85, Jan. 1985, 50 pages.]
      0 references

      Identifiers