Completeness of Timed uCRL

• Autorzy: Reniers M.A. , Groote J.F. , van der Zwaag M.B. , van Wamel J.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

real-time system; process algebras; completeness; micro Common Representation Language

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2002
• Tom: Vol. 50, nr 3,4
• Strony: 361--402
• Opis fizyczny: bibliogr. 74 poz.

Twórcy

autor

Reniers M.A.

autor

Groote J.F.

autor

van der Zwaag M.B.

autor

van Wamel J.

• Department of Mathematics and Computer Science, TU/e, POstbox 513, NL-5600 MB Eindhoven, The Netherlands,