The timed failures — Stability model for CSP

G.M. Reed, A.W. Roscoe
1999 Theoretical Computer Science  
We present a mathematical model which is the most abstract allowing (i) a fully compositional semantics for timed CSP and (ii) a natural abstraction map into the standard failures/divergences model of untimed CSP. We discuss in detail the construction and properties of this model, and explore the variety of nondeterministic behaviour it encompasses. We argue that, at least in some sense, this model is definitive for timed CSP. @ 1999-Elsevier Science B.V. All rights reserved
doi:10.1016/s0304-3975(98)00214-x fatcat:zv3joultwrcyfdhcr7562w6yre