Abstract
In this lecture I present some results of Philippe Darondeau, Doris Nolte, Serge Yoccoz and me on the connection of fairness, II 03 -sets and ultra metrics.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Arnold, M. Nivat. Metric interpretations of infinite trees and semantics of non deterministic programs. TCS 11, pp 181–205, 1980.
G. Costa. A metric characterization of fair computations in CCS. LNCS 186, pp. 239–251, 1985.
J.W. deBakker, J.J. Meyer. Order and metric in the stream semantics of elemental concurrency. Acta Informatica, 1987.
Ph. Darondeau, D. Nolte, L. Priese, S. Yoccoz, Fairness, Distances and Degrees, to appear
P. Degano, U. Montanari. Liveness properties as convergence in metric spaces. STACS 84, pp 31–38, 1984.
R. Milner. A calculus of communicating systems, LNCS 92, 1980.
L. Priese. Fairness. EATCS-Bulletin 35, pp 171–181, 1988.
L. Priese, D. Nolte. Strong fairness, metric spaces and logical complexity. Reihe Theoretische Informatik, Universität-GH Paderborn, Bericht 65, 1990.
L. Priese, R. Rehrmann, Ul Willecke-Klemme. Some results on fairness — the regular case. LNCS 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Priese, L. (1990). Approaching fair computations by ultra metrics. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_18
Download citation
DOI: https://doi.org/10.1007/3-540-53479-2_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53479-2
Online ISBN: 978-3-540-46897-4
eBook Packages: Springer Book Archive