In  a straightforward extension of the process algebra μCRL was proposed to explicitly deal with time. The process algebra μCRL has been especially designed to deal with data in a process algebraic context. Using the features for data, only a minor extension of the language was needed to obtain a very expressive variant of time. But  contains syntax, operational semantics and axioms characterising timed μCRL. It did not contain an in depth analysis of theory of timed μCRL. This paper fills this gap, by providing soundness and completeness results. The main tool to establish these is a mapping of timed to untimed μCRL and employing the completeness results obtained for untimed μCRL.
|Number of pages||42|
|Publication status||Published - 1 May 2002|
- Process algebra