Fairness in models with true concurrency

  • Doris Nolte
  • Lutz Priese
Selected Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 527)


Fairness is defined for an abstract class of formal systems that represent models for true concurrency. It is shown that generally fairness coincides with limits of convergent sequences in some ultra metric spaces and with П 3 0 -sets of recursion theory.


Transition System Program Execution Recursion Theory Weak Fairness Recursive Predicate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BC89]
    G. Boudol and I. Castellani. Concurrency and atomicity. In Theoretical Computer Science (59), pp 1–60, 1989.Google Scholar
  2. [Bes84a]
    E. Best. Fairness and conspiracies — erratum. In Information Processing Letters (19), p 162, 1984.Google Scholar
  3. [Bes84b]
    E. Best. Fairness and conspiracies. In Information Processing Letters (18), pp 215–220, 1984.Google Scholar
  4. [Cos85]
    G. Costa. A metric characterization of fair computations in CCS. In Lecture Notes in Computer Science (185), pp 239–252, 1985.Google Scholar
  5. [CS87]
    G. Costa and C. Stirling. Weak and strong fairness in CCS. In Information and Computation (73), pp 207–244, 1987.Google Scholar
  6. [Dar85]
    P. Darondeau. About fair asynchrony. In Theoretical Computer Science (37), pp 305–336, 1985.Google Scholar
  7. [dB89]
    J.W. de Bakker. Designing concurrency semantics. In 11th World Computer Congress, North Holland, pp 591–598, 1989.Google Scholar
  8. [dBW90]
    J.W. de Bakker and J.H.A. Warmerdam. Metric pomset semantics for a concurrent language with recursion. In Lecture Notes in Computer Science (469), 1990.Google Scholar
  9. [DM84]
    P. Degano and U. Montanari. Liveness properties as convergence in metric spaces. In STOC, pp 31–38, 1984.Google Scholar
  10. [DNPY90]
    P. Darondeau, D. Nolte, L. Priese, and S. Yoccoz. Fairness, distances and degrees. In Internal Report (1199), Unite de Recherche INRIA-Rennes, to appear in Theoretical Computer Science, 1990.Google Scholar
  11. [Fra86]
    N. Francez. Fairness. Springer, 1986.Google Scholar
  12. [Har86]
    D. Harel. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. In Journal of the ACM (33), pp 224–248, 1986.Google Scholar
  13. [Hoa85]
    C.A.R. Hoare. Communicating sequential Processes. Prentice Hall, London, 1985.Google Scholar
  14. [Kwi89]
    M.Z. Kwiatkowska. Fairness for non-interlieving Concurrency. PhD thesis, University of Leicester, 1989.Google Scholar
  15. [LPS81]
    D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness. In Lecture Notes in Computer Science (115), pp 264–277, 1981.Google Scholar
  16. [Mer87]
    A. Merceron. Fair processes. In Lecture Notes in Computer Science (266), pp 181–195, 1987.Google Scholar
  17. [Mil80]
    R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science (92), 1980.Google Scholar
  18. [OA84]
    E.R. Olderog and K.R. Apt. Transformations realizing fairness assumptions for parallel programs. In TR 84-8, LITP, 1984.Google Scholar
  19. [PN90]
    L. Priese and D. Nolte. Strong fairness, metric spaces and logical complexity. In Reihe Informatik (65), U-GH Paderborn, to appear in Theoretical Computer Science, 1990.Google Scholar
  20. [Pra86]
    V. Pratt. Modeling concurrency with partial orders. In International Journal of Parallel Programming, pp 33–71, 1986.Google Scholar
  21. [Pri88]
    L. Priese. Fairness. In EATCS — Bulletin (35), pp 171–181, 1988.Google Scholar
  22. [Pri90]
    L. Priese. Approaching computations by ultra metrics. In Report LITP 9022, Universite Paris VII, 1990.Google Scholar
  23. [PRWK87]
    L. Priese, R. Rehrmann, and U. Willeke-Klemme. Some results on fairness — the regular case. In Lecture Notes in Computer Science (247), pp 383–395, 1987.Google Scholar
  24. [QS83]
    J.P. Queille and J. Sifakis. Fairness and related properties in transition systems — a temporal logic to deal with fairness. In Acta Informatica (19), pp 195–220, 1983.Google Scholar
  25. [Reh88]
    R. Rehrmann. Path — and wordfairness. In Reihe Informatik (43), 1988.Google Scholar
  26. [Rog67]
    H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, 1967.Google Scholar
  27. [Thi90]
    P.S. Thiagarajan. Some behavioural aspects of net theory. In Theoretical Computer Science (71), pp 133–153, 1990.Google Scholar
  28. [UK88]
    U. Willeke-Klemme. Classes of Languages of Fair Finite Automata. PhD thesis, U-GH Paderborn, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Doris Nolte
    • 1
  • Lutz Priese
    • 1
  1. 1.FB 17, Universität-Gesamthochschule PaderbornFRG

Personalised recommendations