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.
Rezensionen / Stimmen
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)
Reihe
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
Dateigröße
ISBN-13
978-1-84882-258-0 (9781848822580)
DOI
10.1007/978-1-84882-258-0
Schweitzer Klassifikation
A Foundation Course in CSP.- Building a Simple Sequential Process.- Understanding CSP.- Parallel Operators.- CSP Case Studies.- Hiding and Renaming.- Beyond Traces.- Further Operators.- Using FDR.- Theory.- Operational Semantics.- Denotational Semantics and Behavioural Models.- Finite Observation Models.- Infinite-Behaviour Models.- The Algebra of CSP.- Using CSP in Practice.- Timed Systems 1: tock-CSP.- Timed Systems 2: Discrete Timed CSP.- More About FDR.- State Explosion and Parameterised Verification.- Exploring Concurrency.- Shared-Variable Programs.- Understanding Shared-Variable Concurrency.- Priority and Mobility.
