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
AbstractIn this paper we present two languages that are refinements of timed CSP (Davies and Schneid...
We consider models of CSP based on recording what events are available as possible alternatives to t...
stevedcsrhbncacuk A theory of timewise renement is presented This allows the translation of specica...
In a previous paper [Low91] we presented two new models of timed CSP. The first model included biase...
AbstractAn operational semantics is defined for the language of timed CSP, in terms of two relations...
Abstract. In previous work the authors investigated the inconsistencies of how suc-cessful terminati...
AbstractThis paper is a comprehensive introduction to the language of Timed CSP, proposed by Reed an...
We develop a model for the real-time behaviour of an extension of communicating sequential processes...
We develop a model for the real-time behaviour of an extension of communicating sequential processes...
AbstractIn this paper we study a denotational model for a discrete-time version of CSP. We give a co...
In this paper we study a denotational model for a discrete-time version of CSP. We give a compositio...
AbstractCompensating CSP (cCSP) models long-running transactions. It can be used to specify service ...
In this paper we present a mathematical model for CSP-like language. This model handles both safety ...
In the original failure-divergence semantic model for Communicating Sequential Processes (CSP), the ...
AbstractConsistency between a process and its specification expressed in CSP is typically presented ...
AbstractIn this paper we present two languages that are refinements of timed CSP (Davies and Schneid...
We consider models of CSP based on recording what events are available as possible alternatives to t...
stevedcsrhbncacuk A theory of timewise renement is presented This allows the translation of specica...
In a previous paper [Low91] we presented two new models of timed CSP. The first model included biase...
AbstractAn operational semantics is defined for the language of timed CSP, in terms of two relations...
Abstract. In previous work the authors investigated the inconsistencies of how suc-cessful terminati...
AbstractThis paper is a comprehensive introduction to the language of Timed CSP, proposed by Reed an...
We develop a model for the real-time behaviour of an extension of communicating sequential processes...
We develop a model for the real-time behaviour of an extension of communicating sequential processes...
AbstractIn this paper we study a denotational model for a discrete-time version of CSP. We give a co...
In this paper we study a denotational model for a discrete-time version of CSP. We give a compositio...
AbstractCompensating CSP (cCSP) models long-running transactions. It can be used to specify service ...
In this paper we present a mathematical model for CSP-like language. This model handles both safety ...
In the original failure-divergence semantic model for Communicating Sequential Processes (CSP), the ...
AbstractConsistency between a process and its specification expressed in CSP is typically presented ...
AbstractIn this paper we present two languages that are refinements of timed CSP (Davies and Schneid...
We consider models of CSP based on recording what events are available as possible alternatives to t...
stevedcsrhbncacuk A theory of timewise renement is presented This allows the translation of specica...