Understanding Concurrent Systems

1. Front Matter

   Pages I-XVIII

   PDF

2. A Foundation Course in CSP

   1. Front Matter

      Pages 1-1

      PDF

   2. Building a Simple Sequential Process

      • A. W. Roscoe

      Pages 3-21

   3. Understanding CSP

      • A. W. Roscoe

      Pages 23-43

   4. Parallel Operators

      • A. W. Roscoe

      Pages 45-66

   5. CSP Case Studies

      • A. W. Roscoe

      Pages 67-91

   6. Hiding and Renaming

      • A. W. Roscoe

      Pages 93-114

   7. Beyond Traces

      • A. W. Roscoe

      Pages 115-129

   8. Further Operators

      • A. W. Roscoe

      Pages 131-142

   9. Using FDR

      • A. W. Roscoe

      Pages 143-187

3. Theory

   1. Front Matter

      Pages 189-189

      PDF

   2. Operational Semantics

      • A. W. Roscoe

      Pages 191-228

   3. Denotational Semantics and Behavioural Models

      • A. W. Roscoe

      Pages 229-253

   4. Finite Observation Models

      • A. W. Roscoe

      Pages 255-270

   5. Infinite-Behaviour Models

      • A. W. Roscoe

      Pages 271-291

   6. The Algebra of CSP

      • A. W. Roscoe

      Pages 293-317

4. Using CSP in Practice

   1. Front Matter

      Pages 319-320

      PDF

   2. Timed Systems 1: tock-CSP

      • A. W. Roscoe

      Pages 321-343

   3. Timed Systems 2: Discrete Timed CSP

      • A. W. Roscoe

      Pages 345-355

   4. More About FDR

      • A. W. Roscoe

      Pages 357-383

CSP notation has been used extensively for teaching and applying concurrency theory, ever since the publication of the text Communicating Sequential Processes by C.A.R. Hoare in 1985. Both a programming language and a specification language, the theory of CSP helps users to understand concurrent systems, and to decide whether a program meets its specification. As a member of the family of process algebras, the concepts of communication and interaction are presented in an algebraic style. An invaluable reference on the state of the art in CSP, Understanding Concurrent Systems also serves as a comprehensive introduction to the field, in addition to providing material for a number of more advanced courses. A first point of reference for anyone wanting to use CSP or learn about its theory, the book also introduces other views of concurrency, using CSP to model and explain these. The text is fully integrated with CSP-based tools such as FDR, and describes how to create new tools based on FDR. Most of the book relies on no theoretical background other than a basic knowledge of sets and sequences. Sophisticated mathematical arguments are avoided whenever possible. Topics and features: presents a comprehensive introduction to CSP; discusses the latest advances in CSP, covering topics of operational semantics, denotational models, finite observation models and infinite-behaviour models, and algebraic semantics; explores the practical application of CSP, including timed modelling, discrete modelling, parameterised verifications and the state explosion problem, and advanced topics in the use of FDR; examines the ability of CSP to describe and enable reasoning about parallel systems modelled in other paradigms; covers a broad variety of concurrent systems, including combinatorial, timed, priority-based, mobile, shared variable, statecharts, buffered and asynchronous systems; contains exercises and case studies to support the text; supplies further tools and information at theassociated website: http://www.comlab.ox.ac.uk/ucs/. From undergraduate students of computer science in need of an introduction to the area, to researchers and practitioners desiring a more in-depth understanding of theory and practice of concurrent systems, this broad-ranging text/reference is essential reading for anyone interested in Hoare’s CSP.

• Notation
• Variable
• communicating sequential process
• communication
• computer
• concurrency
• concurrency theory
• information
• linear optimization
• modeling
• process algebra
• programming
• programming language
• semantics
• verification

From the reviews:

“This book is divided into four parts … . Part I is designed for an audience of both undergraduate and graduate computer science students. … Part II is designed for people who are familiar with Part I and have fairly theoretical interests. … Part III is intended for people who … want to be able to use them in a better way, or who are specifically interested in timed systems. Part IV is designed for people who already understand CSP.” (Günther Bauer, Zentralblatt MATH, Vol. 1211, 2011)

• Oxford University Computing Laboratory, Oxford, United Kingdom

  A.W. Roscoe

Policies and ethics