Process algebra : equational theories of communicating processes

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

Research output: Book/ReportBookAcademic

Abstract

Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behavior. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer’s Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate. Contents Preface; 1. Process algebra; 2. Preliminaries; 3. Transition systems; 4. Basic process theory; 5. Recursion; 6. Sequential processes; 7. Parallel and communicating processes; 8. Abstraction; 9. Timing; 10. Data and states; 11. Features; 12. Semantics; Bibliography; Index of symbols and notations; Index of authors; Index of subjects.
LanguageEnglish
Place of PublicationCambridge
PublisherCambridge University Press
Number of pages460
ISBN (Print)978-0-521-82049-3
DOIs
StatePublished - 2010

Publication series

NameCambridge tracts in theoretical computer science
Volume50
ISSN (Print)0956-9103

Fingerprint

Equational Theory
Process Algebra
Notation
Distributed Systems
Mutual Exclusion
Data Communication
Transition Systems
Parallel Systems
Recursion
Software System
Axioms
Timing
Computer Science
Maintenance
Specification
Verify
Software
Text

Cite this

Baeten, J. C. M., Basten, T., & Reniers, M. A. (2010). Process algebra : equational theories of communicating processes. (Cambridge tracts in theoretical computer science; Vol. 50). Cambridge: Cambridge University Press. DOI: 10.1017/CBO9781139195003
Baeten, J.C.M. ; Basten, T. ; Reniers, M.A./ Process algebra : equational theories of communicating processes. Cambridge : Cambridge University Press, 2010. 460 p. (Cambridge tracts in theoretical computer science).
@book{0728d26f61e141a49c638915c327a29e,
title = "Process algebra : equational theories of communicating processes",
abstract = "Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behavior. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer’s Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate. Contents Preface; 1. Process algebra; 2. Preliminaries; 3. Transition systems; 4. Basic process theory; 5. Recursion; 6. Sequential processes; 7. Parallel and communicating processes; 8. Abstraction; 9. Timing; 10. Data and states; 11. Features; 12. Semantics; Bibliography; Index of symbols and notations; Index of authors; Index of subjects.",
author = "J.C.M. Baeten and T. Basten and M.A. Reniers",
year = "2010",
doi = "10.1017/CBO9781139195003",
language = "English",
isbn = "978-0-521-82049-3",
series = "Cambridge tracts in theoretical computer science",
publisher = "Cambridge University Press",
address = "United Kingdom",

}

Baeten, JCM, Basten, T & Reniers, MA 2010, Process algebra : equational theories of communicating processes. Cambridge tracts in theoretical computer science, vol. 50, Cambridge University Press, Cambridge. DOI: 10.1017/CBO9781139195003

Process algebra : equational theories of communicating processes. / Baeten, J.C.M.; Basten, T.; Reniers, M.A.

Cambridge : Cambridge University Press, 2010. 460 p. (Cambridge tracts in theoretical computer science; Vol. 50).

Research output: Book/ReportBookAcademic

TY - BOOK

T1 - Process algebra : equational theories of communicating processes

AU - Baeten,J.C.M.

AU - Basten,T.

AU - Reniers,M.A.

PY - 2010

Y1 - 2010

N2 - Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behavior. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer’s Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate. Contents Preface; 1. Process algebra; 2. Preliminaries; 3. Transition systems; 4. Basic process theory; 5. Recursion; 6. Sequential processes; 7. Parallel and communicating processes; 8. Abstraction; 9. Timing; 10. Data and states; 11. Features; 12. Semantics; Bibliography; Index of symbols and notations; Index of authors; Index of subjects.

AB - Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behavior. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer’s Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate. Contents Preface; 1. Process algebra; 2. Preliminaries; 3. Transition systems; 4. Basic process theory; 5. Recursion; 6. Sequential processes; 7. Parallel and communicating processes; 8. Abstraction; 9. Timing; 10. Data and states; 11. Features; 12. Semantics; Bibliography; Index of symbols and notations; Index of authors; Index of subjects.

UR - http://www.processalgebra.org/

U2 - 10.1017/CBO9781139195003

DO - 10.1017/CBO9781139195003

M3 - Book

SN - 978-0-521-82049-3

T3 - Cambridge tracts in theoretical computer science

BT - Process algebra : equational theories of communicating processes

PB - Cambridge University Press

CY - Cambridge

ER -

Baeten JCM, Basten T, Reniers MA. Process algebra : equational theories of communicating processes. Cambridge: Cambridge University Press, 2010. 460 p. (Cambridge tracts in theoretical computer science). Available from, DOI: 10.1017/CBO9781139195003