We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discrete and dense timing. We build up the theory incrementally. The different algebras are interrelated by embeddings and conservative extensions. As an example, we consider the PAR communication protocol.
|Title of host publication||Formal Methods for the Design of Real-Time Systems (Revised Lectures, International School, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004)|
|Editors||M. Bernardo, F. Corradini|
|Place of Publication||Berlin|
|Number of pages||39|
|Publication status||Published - 1 Dec 2004|
|Name||Lecture Notes in Computer Science|