Skip to main content
SpringerLink
Log in

Fairness in models with true concurrency

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '91 (CONCUR 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 527))

Included in the following conference series:

Abstract

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 П 03 -sets of recursion theory.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Boudol and I. Castellani. Concurrency and atomicity. In Theoretical Computer Science (59), pp 1–60, 1989.

    Google Scholar 

  2. E. Best. Fairness and conspiracies — erratum. In Information Processing Letters (19), p 162, 1984.

    Google Scholar 

  3. E. Best. Fairness and conspiracies. In Information Processing Letters (18), pp 215–220, 1984.

    Google Scholar 

  4. G. Costa. A metric characterization of fair computations in CCS. In Lecture Notes in Computer Science (185), pp 239–252, 1985.

    Google Scholar 

  5. G. Costa and C. Stirling. Weak and strong fairness in CCS. In Information and Computation (73), pp 207–244, 1987.

    Google Scholar 

  6. P. Darondeau. About fair asynchrony. In Theoretical Computer Science (37), pp 305–336, 1985.

    Google Scholar 

  7. J.W. de Bakker. Designing concurrency semantics. In 11th World Computer Congress, North Holland, pp 591–598, 1989.

    Google Scholar 

  8. 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. P. Degano and U. Montanari. Liveness properties as convergence in metric spaces. In STOC, pp 31–38, 1984.

    Google Scholar 

  10. 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. N. Francez. Fairness. Springer, 1986.

    Google Scholar 

  12. 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. C.A.R. Hoare. Communicating sequential Processes. Prentice Hall, London, 1985.

    Google Scholar 

  14. M.Z. Kwiatkowska. Fairness for non-interlieving Concurrency. PhD thesis, University of Leicester, 1989.

    Google Scholar 

  15. 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. A. Merceron. Fair processes. In Lecture Notes in Computer Science (266), pp 181–195, 1987.

    Google Scholar 

  17. R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science (92), 1980.

    Google Scholar 

  18. E.R. Olderog and K.R. Apt. Transformations realizing fairness assumptions for parallel programs. In TR 84-8, LITP, 1984.

    Google Scholar 

  19. 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. V. Pratt. Modeling concurrency with partial orders. In International Journal of Parallel Programming, pp 33–71, 1986.

    Google Scholar 

  21. L. Priese. Fairness. In EATCS — Bulletin (35), pp 171–181, 1988.

    Google Scholar 

  22. L. Priese. Approaching computations by ultra metrics. In Report LITP 9022, Universite Paris VII, 1990.

    Google Scholar 

  23. 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. 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. R. Rehrmann. Path — and wordfairness. In Reihe Informatik (43), 1988.

    Google Scholar 

  26. H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, 1967.

    Google Scholar 

  27. P.S. Thiagarajan. Some behavioural aspects of net theory. In Theoretical Computer Science (71), pp 133–153, 1990.

    Google Scholar 

  28. U. Willeke-Klemme. Classes of Languages of Fair Finite Automata. PhD thesis, U-GH Paderborn, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB 17, Universität-Gesamthochschule Paderborn, FRG

    Doris Nolte & Lutz Priese

Authors
  1. Doris Nolte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lutz Priese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jos C. M. Baeten Jan Frisco Groote

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nolte, D., Priese, L. (1991). Fairness in models with true concurrency. 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_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-54430-5_106

  • 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

Publish with us

Policies and ethics

Search

Navigation