Timed process algebra (with a focus on explicit termination and relative-timing)

J.C.M. Baeten, M.A. Reniers

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    7 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationFormal Methods for the Design of Real-Time Systems (Revised Lectures, International School, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004)
    EditorsM. Bernardo, F. Corradini
    Place of PublicationBerlin
    PublisherSpringer
    Pages59-97
    Number of pages39
    ISBN (Print)3-540-23068-8
    DOIs
    Publication statusPublished - 1 Dec 2004

    Publication series

    NameLecture Notes in Computer Science
    Volume3185
    ISSN (Print)0302-9743

    Fingerprint Dive into the research topics of 'Timed process algebra (with a focus on explicit termination and relative-timing)'. Together they form a unique fingerprint.

    Cite this