A timed model for communicating sequential processes

Abstract

The parallel language CSP [H,1985], an earlier version of which was described in [H,1978], has become a major tool for the analysis of structuring methods and proof systems involving paxallellsm. The significance of CSP is in the elegance by which a few simply stated constructs (e.g., sequential and parallel composition, nondeterminlstic choice, concealment, and recursion) lead to a language capable of expressing the full complexity of distributed computing. The difficulty in achieving satisfactory semantic models containing these constructs has been in providing an adequate treatment of nondeterminism, deadlock, and divergence. Fortunately, as a result of an evolutionary development in [

Static Enforcement of Service Deadlines

“…Timed extensions of process calculi have been studied since the late eighties [1,2,5,10,11,16,19,21,24]. A number of these calculi have been compared in [18], by considering their behaviour w.r.t.…”

A process algebraic framework for specification and validation of real-time systems

“…Timed CSP [RR88] is an extension of CSP that includes new operators like Wait and £ (timeout). It has a new semantic model, derived from the untimed models of CSP, to represent dense time information, and a proof system [DS95,Sch00].…”

Testing timed systems modeled by Stream X-machines

“…Even though there exists a myriad of timed extensions of the classical frameworks [45,42,50,36,41,1,17,13,2], most of them specialize only on the time that a system consumes performing operations. However, another kind of time constraint can affect systems: Timeouts.…”