Skip to main content
Springer Nature Link
Log in

Semantic for abstract fairness using metric spaces

  • Conference paper
  • First Online:
CSL '89 (CSL 1989)

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

Included in the following conference series:

  • 127 Accesses

Abstract

We introduce metric spaces that allow to characterize fair computations in finite transition systems without structured states as limits of convergent series and fair languages as the set of cluster points.

This research was supported by a grant of the DFG.

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.

Similar content being viewed by others

References

  1. A. Arnold and M. Nivat. Metric interpretations of infinite trees and semantics of non deterministic recursive programs. In Theoretical Computer Science, 11, pages 181–205, 1980.

    Google Scholar 

  2. E. Best. Fairness and conspiracies. In Information Processing Letters, 18, pages 215–220, 1984.

    Google Scholar 

  3. G. Costa. A metric characterization of fair computations in ccs. In Lecture Notes in Computer Science, vol 186, pages 239–251, 1985.

    Google Scholar 

  4. P. Darondeau. About fair asynchrony. In Theoretical Computer Science, 37, pages 305–336, 1985.

    Google Scholar 

  5. J.W. de Bakker and J.J. Meyer. Order and metric in the stream semantics of elemental concurrency. In Acta Informatica, 1987.

    Google Scholar 

  6. P. Degano and U. Montanari. Liveness properties as convergence in metric spaces. In STOC, pages 31–38, 1984.

    Google Scholar 

  7. J. Hoogeboom and G. Rozenberg. Infinitary languages. In Lecture Notes in Computer Science, 224, pages 266–342, 1986.

    Google Scholar 

  8. L. Landweber. Decision problems for w-automata. In Mathematical System Theory, 4, pages 376–384, 1969.

    Google Scholar 

  9. R. Milner. A calculus of communicating systems. In Lecture Notes in Computer Science, 92, 1980.

    Google Scholar 

  10. L. Priese. Fairness. In EATCS — Bulletin, 35, pages 171–181, 1988.

    Google Scholar 

  11. R. Rehrmann. Path — and Wordfairness. PhD thesis, U-GH Paderborn, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität-Gesamthochschule Paderborn, FRG

    Lutz Priese & Doris Nolte

Authors
  1. Lutz Priese
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Doris Nolte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Priese, L., Nolte, D. (1990). Semantic for abstract fairness using metric spaces. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '89. CSL 1989. Lecture Notes in Computer Science, vol 440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52753-2_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-52753-2_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52753-4

  • Online ISBN: 978-3-540-47137-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation