Completeness of timed μCRL

J.F. Groote, M.A. Reniers, J. van Wamel, M.B. van der Zwaag

    Research output: Contribution to journalArticleAcademicpeer-review

    19 Citations (Scopus)
    1 Downloads (Pure)


    In [25] 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 [25] 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.

    Original languageEnglish
    Article number3-4
    Pages (from-to)361-402
    Number of pages42
    JournalFundamenta Informaticae
    Issue number3-4
    Publication statusPublished - 1 May 2002


    • μCRL
    • Completeness
    • Process algebra
    • Real-time


    Dive into the research topics of 'Completeness of timed μCRL'. Together they form a unique fingerprint.

    Cite this