Skip to main content
Article thumbnail
Location of Repository

Fairness for Non-Interleaving Concurrency

By Marta Zofia Kwiatkowska


Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to the interleaving approach, which reduces non-sequential behaviours to a nondeterministic choice between possible interleavings of activities of concurrent processes, concurrency and causality were assumed as primitive notions. Mazurkiewicz's trace languages were chosen as behavioural representations of systems and Shields' asynchronous transition systems as their acceptors. The notion central to these two formalisms is one of causal independency, which determines trace equivalence (congruence) in the monoid of strings. Equivalence classes of strings are called traces.\ud The quotient monoid of traces forms a poset with trace prefix ordering.\ud First, trace languages have been enhanced to allow for infmite traces; this was achieved by introducing trace preorder relation on possibly infinite strings. It has been shown that the extension gives rise to the domain of traces and an infinitary monoid, which specializes to the domain and the infinitary monoid of strings of Nivat's, Asynchronous transition systems have been equipped with a notion of a process structure; a variety of process structures ordered by refinement relation are possible for a given system. Each process structure determines projective preorder and equivalence relations in the monoid of strings, which are shown to coincide with the trace preorder and trace equivalence.\ud In this setting, a topological characterization of behavioural properties which includes safety, progress and fairness properties has been provided. Fairness properties form a subclass of infinitary progress properties that is closed under arbitrary union.\ud Unconditional process fairness properties that are determined by process structures have been distinguished; they form a lattice with inclusion ordering. Finally, strength predicates were incorporated to allow for a variety of specific fairness properties such as weak and strong process fairness as well as equifairness and state fairness

Publisher: University of Leicester
Year: 1989
OAI identifier:

Suggested articles


  1. (1980). A calculus for communicating systems, doi
  2. (1980). A Compendium (~fContinuous Lattices,
  3. (1986). A Complete Rule for Equifair Termination, doi
  4. (1976). A Discipline ofprogramming,
  5. (1984). A Fair Calculus of Communicating Systems, doi
  6. (1982). A Powerdomain for Countable Non-determinism, in: doi
  7. (1979). A Survey of Fairness Notions, to appear III
  8. (1984). A Theory of Communicating Sequential Processes, doi
  9. (1986). Algebra of communicating processes, in: doi
  10. (1987). An Algebraic Theory of Fair Asynchronous Communicating Processes, doi
  11. (1981). An axiomatic definition of synchronisation primitives, doi
  12. (1976). An Axiomatic Proof Technique for Parallel Programs, doi
  13. (1987). An Introduction to the Regular Theory of Fairness, doi
  14. (1988). Analysing infinitely branching transition systems,
  15. (1988). Another View of 'Fairness', doi
  16. (1986). Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends, in: doi
  17. (1987). Appraising Fairness in Languages for Distributed Programming, in: doi
  18. (1988). Basic Notions of Trace Theory, in: REX School/Workshop on Linear Time, Branching time and Partial Order in Logics and Models for Concurrency (Nordwijkerhout, doi
  19. (1988). Behavioural Presentation, in: REX Schooltworkshop on Linear Time, Branching time and Partial Order in Logics and Models for Concurrency (Nordwijkerhout, doi
  20. (1986). Bounded non-determinism and induction principle in process algebra,
  21. (1984). Communicating Sequential Processes, doi
  22. (1981). Concurrency and Automata on Infinite Sequences, in: doi
  23. (1977). Concurrent Program Schemes and Their Interpretations, doi
  24. (1985). Defining Liveness, doi
  25. (1977). Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, doi
  26. (1983). Domains and Predicate Transformers, a topological view, in: doi
  27. (1988). Event Fairness in Asynchronous Transition Systems,
  28. (1986). Event Structures, doi
  29. (1986). Fair Processes, in: doi
  30. (1984). Fairness and Conspiracies, doi
  31. (1983). Fairness and Related Properties in Transition Systems - A Temporal Logic to Deal with Fairness, doi
  32. (1985). Fairness Properties in Process Algebra with Applications in Communication Protocol Verification.
  33. (1976). Formal Verification of Parallel Programs, doi
  34. (1987). Grumberg 0., doi
  35. (1981). Impartiality, Justice and Fairness: The Ethics of Concurrent Termination, in: doi
  36. (1987). in: doi
  37. (1987). Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency, doi
  38. (1988). Modelling Concurrency Using Ambiguous Asynchronous Transition Systems,
  39. (1983). Modelling Finite Delay Operators, doi
  40. (1984). Modelling the distributed termination convention in esp, doi
  41. (1987). Models for Parallelism.
  42. (1960). Naive Set Theory,
  43. (1985). Nets, An Introduction, doi
  44. (1986). nets: basic notions, structure, behaviour, in: Current Trends doi
  45. (1987). Non-Interleaving Semantic Model for NonDeterministic Concurrent Processes,
  46. (1984). Now You May Compose Temporal Logic Specifications, in: doi
  47. (1983). On the extremely fair treatment of probabilistic algorithms, in: doi
  48. (1979). On the Semantics of Fair Parallelism, in: Abstract Software Specifications, doi
  49. (1980). On the Temporal Analysis of Fairness, in: doi
  50. (1988). Operational and Algebraic Semantics of Concurrent Processes, doi
  51. (1969). Parallel Program Schemata, doi
  52. (1988). Permutation of transitions: an event structure semantics for CCS and SCCS, in: REX School/Workshop on Linear Time, Branching time and Partial Order in Logics and Models for Concurrency (Nordwijkerhout, doi
  53. (1988). Position Paper on Fairness, doi
  54. (1987). Proof of specification properties by using finite state machines and temporal logic, in:
  55. (1975). Proving Assertions about Parallel Programs, doi
  56. (1982). Proving Liveness Properties of Concurrent Programs, doi
  57. (1977). Proving the Correctness of Multiprocess Programs, doi
  58. (1984). Semantics of Concurrent Systems: A Modular FixedPoint Trace Approach, in: doi
  59. (1987). Semantique Asynchrone et Comportements Infini en CSP, doi
  60. (1986). Sometimes' and 'Not Never' Revisited: On Branching versus Linear Time Temporal Logic, doi
  61. (1981). Temporal verification of concurrent programs,
  62. (1988). Theory of Traces, doi
  63. (1984). Traces, Ilistories, Graphs: Instances of a Process Monoid, in: doi
  64. (1984). Transformations Realizing Fairness Assumptions for Parallel Programs, in: doi
  65. (1983). Verification of fairness in an implementation of monitors, in:
  66. (1986). Verification of multiprocess probabilistic protocols, doi
  67. (1987). Weak and Strong Fairness in CCS, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.