We propose a denotational model for real time concurrent systems, based on the failures model for CSP. The fixed point theory is based on the Banach fixed point theorem for complete metric spaces, since the introduction of time as a measure makes all recursive operators naturally contractive. This frees us from many of the constraints imposed by partial orders on the treatment of nondeterminism and divergence.
CITATION STYLE
Reed, G. M., & Roscoe, A. W. (1988). Metric spaces as models for real-time concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 298 LNCS, pp. 331–343). Springer Verlag. https://doi.org/10.1007/3-540-19020-1_17
Mendeley helps you to discover research relevant for your work.