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

J.C.M. Baeten; M.A. Reniers

doi:10.1007/b110123

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 proceeding › Conference contribution › Academic › peer-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 language	English
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
Publisher	Springer
Pages	59-97
Number of pages	39
ISBN (Print)	3-540-23068-8
DOIs	https://doi.org/10.1007/b110123
Publication status	Published - 1 Dec 2004

Publication series

Name	Lecture Notes in Computer Science
Volume	3185
ISSN (Print)	0302-9743

Access to Document

10.1007/b110123

Cite this

Baeten, J. C. M., & Reniers, M. A. (2004). Timed process algebra (with a focus on explicit termination and relative-timing). In M. Bernardo, & F. Corradini (Eds.), Formal Methods for the Design of Real-Time Systems (Revised Lectures, International School, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004) (pp. 59-97). (Lecture Notes in Computer Science; Vol. 3185). Springer. https://doi.org/10.1007/b110123

Baeten, J.C.M. ; Reniers, M.A. / Timed process algebra (with a focus on explicit termination and relative-timing). Formal Methods for the Design of Real-Time Systems (Revised Lectures, International School, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004). editor / M. Bernardo ; F. Corradini. Berlin : Springer, 2004. pp. 59-97 (Lecture Notes in Computer Science).

@inproceedings{24e9fefce8d74d9eaf29432cbac095bf,

title = "Timed process algebra (with a focus on explicit termination and relative-timing)",

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.",

author = "J.C.M. Baeten and M.A. Reniers",

year = "2004",

month = dec,

day = "1",

doi = "10.1007/b110123",

language = "English",

isbn = "3-540-23068-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "59--97",

editor = "M. Bernardo and F. Corradini",

booktitle = "Formal Methods for the Design of Real-Time Systems (Revised Lectures, International School, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004)",

}

Baeten, JCM & Reniers, MA 2004, Timed process algebra (with a focus on explicit termination and relative-timing). in M Bernardo & F Corradini (eds), Formal Methods for the Design of Real-Time Systems (Revised Lectures, International School, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004). Lecture Notes in Computer Science, vol. 3185, Springer, Berlin, pp. 59-97. https://doi.org/10.1007/b110123

Timed process algebra (with a focus on explicit termination and relative-timing). / Baeten, J.C.M.; Reniers, M.A.
Formal Methods for the Design of Real-Time Systems (Revised Lectures, International School, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004). ed. / M. Bernardo; F. Corradini. Berlin: Springer, 2004. p. 59-97 (Lecture Notes in Computer Science; Vol. 3185).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Baeten, J.C.M.

AU - Reniers, M.A.

PY - 2004/12/1

Y1 - 2004/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746354864&partnerID=8YFLogxK

U2 - 10.1007/b110123

DO - 10.1007/b110123

M3 - Conference contribution

SN - 3-540-23068-8

T3 - Lecture Notes in Computer Science

SP - 59

EP - 97

BT - Formal Methods for the Design of Real-Time Systems (Revised Lectures, International School, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004)

A2 - Bernardo, M.

A2 - Corradini, F.

PB - Springer

CY - Berlin

ER -

Baeten JCM, Reniers MA. Timed process algebra (with a focus on explicit termination and relative-timing). In Bernardo M, Corradini F, editors, Formal Methods for the Design of Real-Time Systems (Revised Lectures, International School, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004). Berlin: Springer. 2004. p. 59-97. (Lecture Notes in Computer Science). doi: 10.1007/b110123

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

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this