Process Algebra

Equational Theories of Communicating Processes

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

Write A Review

Hardcover | 21 January 2010

At a Glance

Hardcover
478 Pages

Dimensions(cm)
15.9 x 23.3 x 3.0

Hardcover

RRP $179.95

$159.75

11%OFF

or 4 interest-free payments of $39.94 with

Ships in 5 to 7 business days

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

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Computer Architecture & Logic Design Parallel Processing Mathematics Algebra Computer Programming & Software Development Programming & Scripting Languages Mathematical Theory of Computation

Foreword	p. ix
Foreword	p. x
Foreword	p. xi
Preface	p. xiii
Process algebra	p. 1
Definition	p. 1
Calculation	p. 3
History	p. 4
Preliminaries	p. 11
Introduction	p. 11
Equational theories	p. 11
Algebras	p. 21
Term rewriting systems	p. 30
Bibliographical remarks	p. 34
Transition systems	p. 35
Transition-system spaces	p. 35
Structural operational semantics	p. 47
Bibliographical remarks	p. 64
Basic process theory	p. 67
Introduction	p. 67
The process theory MPT	p. 68
The term model	p. 72
The empty process	p. 81
Projection	p. 92
Prefix iteration	p. 102
Bibliographical remarks	p. 107
Recursion	p. 109
Introduction	p. 109
Recursive specifications	p. 110
Solutions of recursive specifications	p. 113
The term model	p. 119
Recursion principles	p. 124
Describing a stack	p. 146
Expressiveness and definability	p. 148
Regular processes	p. 154
Recursion and BSP*(A)	p. 157
The projective limit model	p. 159
Bibliographical remarks	p. 168
Sequential processes	p. 171
Sequential composition	p. 171
The process theory TSP	p. 171
The term model	p. 174
Projection in TSP(A)	p. 177
Iteration	p. 178
Recursion	p. 182
Renaming, encapsulation, and skip operators	p. 189
Bibliographical remarks	p. 194
Parallel and communicating processes	p. 195
Interleaving	p. 195
An operational view	p. 196
Standard communication	p. 199
The process theory BCP	p. 201
The term model	p. 216
Recursion, buffers, and bags	p. 218
The process theory TCP and further extensions	p. 227
Specifying the Alternating-Bit Protocol	p. 235
Bibliographical remarks	p. 242
Abstraction	p. 245
Introduction	p. 245
Transition systems with silent steps	p. 246
BSP with silent steps	p. 256
The term model	p. 258
Some extensions of BSP_&tau(A)	p. 267
TCP with silent steps	p. 276
Iteration and divergence	p. 280
Recursion and fair abstraction	p. 284
Verification of the ABP and queues revisited	p. 295
Bibliographical remarks	p. 298
Timing	p. 301
Introduction	p. 301
Timed transition systems	p. 304
Discrete time, relative time	p. 307
The term model	p. 309
Time iteration and delayable actions	p. 312
The relation between BSP(A) and BSP^drt*(A)	p. 317
The process theory TCP^drt*(A, ¿)	p. 319
Fischer's protocol	p. 327
Bibliographical remarks	p. 333
Data and states	p. 335
Introduction	p. 335
Guarded commands	p. 336
The inaccessible process	p. 345
Propositional signals	p. 348
State operators	p. 362
Choice quantification	p. 366
Bibliographical remarks	p. 374
Features	p. 375
Priorities	p. 375
Probabilities	p. 381
Mobility	p. 387
Parallel composition revisited	p. 389
Bibliographical remarks	p. 391
Semantics	p. 393
Bisimilarity and trace semantics	p. 393
Failures and readiness semantics	p. 397
The linear time - branching time lattice	p. 401
Partial-order semantics	p. 407
Bibliographical remarks	p. 410
Bibliography	p. 411
Index of Symbols and Notations	p. 421
Index of Authors	p. 435
Index of Subjects	p. 439
Table of Contents provided by Ingram. All Rights Reserved.

Process Algebra

Equational Theories of Communicating Processes

At a Glance

Hardcover

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Theory of Computation

Quantum Control of Hybrid Spin-Oscillator Systems

Springer Theses

Computational Science - ICCS 2026

26th International Conference, Hamburg, Germany, June 29 - July 1, 2026, Proceedings, Part I

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

Discrete Mathematics for Computing

Grassroots

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

AI Engineering

Building Applications with Foundation Models

Effective Machine Learning Teams

Best Practices for ML Practitioners

Nonlinear Analysis for Human Movement Variability

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

AI for Decision Intelligence in Critical Systems

Advances in Applied Mathematics

AI for Decision Intelligence in Critical Systems

Advances in Applied Mathematics

Theory of Computation for Software Developers

Theory of Computation for Software Developers

Introduction to Modern Cryptography

Revised Third Edition

Machine Learning Interviews

Kickstart Your Machine Learning and Data Career

Decentralized Futures

Navigating the Integration of Blockchain Technology with Artificial Intelligence

Beading With Algorithms

Cellular Automata In Peyote Stitch

Beading With Algorithms

Cellular Automata In Peyote Stitch

Applied Mathematics with F#

Computability and Computational Explanation

Elements in the Philosophy of Mathematics

Computability and Computational Explanation

Elements in the Philosophy of Mathematics

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

This product is categorised by