Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems / Edition 1

by Howard Bowman, Rodolfo Gomez

Overview

In the world we live in concurrency is the norm. For example, the human body is a massively concurrent system, comprising a huge number of cells, all sim- taneously evolving and independently engaging in their individual biological processing. In addition, in the biological world, truly sequential systems rarely arise. However, they are more common when manmade artefacts are cons- ered. In particular, computer systems are often developed from a sequential perspective. Why is this? The simple reason is that it is easier for us to think about sequential, rather than concurrent, systems. Thus, we use sequentiality as a device to simplify the design process. However, the need for increasingly powerful,—exible and usable computer systems mitigates against simplifying sequentiality assumptions. A good - ample of this is the all-powerful position held by the Internet, which is highly concurrent at many different levels of decomposition. Thus, the modern c- puter scientist (and indeed the modern scientist in general) is forced to think about concurrent systems and the subtle and intricate behaviour that emerges from the interaction of simultaneously evolving components. Over a period of 25 years, or so, the field of concurrency theory has been involved in the development of a set of mathematical techniques that can help system developers to think about and build concurrent systems. These theories are the subject matter of this book.

Product Details

ISBN-13:	9781849969512
Publisher:	Springer London
Publication date:	11/05/2010
Edition description:	Softcover reprint of hardcover 1st ed. 2006
Pages:	422
Product dimensions:	6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

Background on Concurrency Theory.- Concurrency Theory — Untimed Models.- Process Calculi: LOTOS.- Basic Interleaved Semantic Models.- True Concurrency Models: Event Structures.- Testing Theory and the Linear Time — Branching Time Spectrum.- Concurrency Theory — Further Untimed Notations.- Beyond pbLOTOS.- Comparison of LOTOS with CCS and CSP.- Communicating Automata.- Concurrency Theory — Timed Models.- Timed Process Calculi, a LOTOS Perspective.- Semantic Models for tLOTOS.- Timed Communicating Automata.- Timelocks in Timed Automata.- Discrete Timed Automata.

Editorial Reviews

From the reviews:

"This book covers a wide range of results from works in concurrency theory … . scientists and students doing research in various related areas such as concurrency control or parallel computing will find this book quite useful. … the book represents a comprehensive coverage of the development of concurrency theory reflecting the historical progression of the field. … The book undoubtedly will suit students and specialists doing research in concurrency theory … ." (Alekber Aliyev, Zentralblatt MATH, Vol. 1140, 2008)

From the Publisher