In [25] a straightforward extension of the process algebra uCRL was proposed to explicitly deal with time. The process algebra uCRL 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 [25] contains syntax, operational semantics and axioms characterising timed uCRL. It did not contain an in depth analysis of theory of timed uCRL. This paper fills this gap, by providing soundness and completeness results. The main tool to establish these is a mapping of timed to untimed uCRL and employing the completeness results obtained for untimed uCRL.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.