Semantic for abstract fairness using metric spaces
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.
KeywordsCluster Point Regular Language Label Transition System Denotational Semantic Recursive Program
Unable to display preview. Download preview PDF.
- [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
- [Bes84]E. Best. Fairness and conspiracies. In Information Processing Letters, 18, pages 215–220, 1984.Google Scholar
- [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
- [Dar85]P. Darondeau. About fair asynchrony. In Theoretical Computer Science, 37, pages 305–336, 1985.Google Scholar
- [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
- [DM84]P. Degano and U. Montanari. Liveness properties as convergence in metric spaces. In STOC, pages 31–38, 1984.Google Scholar
- [HR86]J. Hoogeboom and G. Rozenberg. Infinitary languages. In Lecture Notes in Computer Science, 224, pages 266–342, 1986.Google Scholar
- [Lan69]L. Landweber. Decision problems for w-automata. In Mathematical System Theory, 4, pages 376–384, 1969.Google Scholar
- [Mil80]R. Milner. A calculus of communicating systems. In Lecture Notes in Computer Science, 92, 1980.Google Scholar
- [Pri88]L. Priese. Fairness. In EATCS — Bulletin, 35, pages 171–181, 1988.Google Scholar
- [Reh88]R. Rehrmann. Path — and Wordfairness. PhD thesis, U-GH Paderborn, 1988.Google Scholar