Advertisement

Semantic for abstract fairness using metric spaces

  • Lutz Priese
  • Doris Nolte
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 440)

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.

Keywords

Cluster Point Regular Language Label Transition System Denotational Semantic Recursive Program 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AN80]
    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. [Bes84]
    E. Best. Fairness and conspiracies. In Information Processing Letters, 18, pages 215–220, 1984.Google Scholar
  3. [Cos85]
    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. [Dar85]
    P. Darondeau. About fair asynchrony. In Theoretical Computer Science, 37, pages 305–336, 1985.Google Scholar
  5. [dBM87]
    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. [DM84]
    P. Degano and U. Montanari. Liveness properties as convergence in metric spaces. In STOC, pages 31–38, 1984.Google Scholar
  7. [HR86]
    J. Hoogeboom and G. Rozenberg. Infinitary languages. In Lecture Notes in Computer Science, 224, pages 266–342, 1986.Google Scholar
  8. [Lan69]
    L. Landweber. Decision problems for w-automata. In Mathematical System Theory, 4, pages 376–384, 1969.Google Scholar
  9. [Mil80]
    R. Milner. A calculus of communicating systems. In Lecture Notes in Computer Science, 92, 1980.Google Scholar
  10. [Pri88]
    L. Priese. Fairness. In EATCS — Bulletin, 35, pages 171–181, 1988.Google Scholar
  11. [Reh88]
    R. Rehrmann. Path — and Wordfairness. PhD thesis, U-GH Paderborn, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

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

Personalised recommendations