First book to adopt the approach taken by the LOTOS process calculi and its theory
Combines timed automata with region graph based model-checking – a highly topical approach
First book to adopt the approach taken by the LOTOS process calculi and its theory
Combines timed automata with region graph based model-checking – a highly topical approach
Includes supplementary material: sn.pub/extras
Intheworldweliveinconcurrencyisthenorm.Forexample,thehumanbody isamassivelyconcurrentsystem,comprisingahugenumberofcells,allsim- taneously evolving and independently engaging in their individual biological processing.Inaddition,inthebiologicalworld,trulysequentialsystemsrarely 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 di?erent levels of decomposition. Thus, the modern c- puter scientist (and indeed the modern scientist in general) is forced to think aboutconcurrentsystemsandthesubtleandintricatebehaviourthatemerges from the interaction of simultaneously evolving components. Over a period of 25 years, or so, the ?eld 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.|
The field of concurrency theory is becoming increasingly important, with the problem of formally verifying concurrent distributed systems a critical consideration and a major topic for the software industries. This book, with its extensive applications of the techniques involved in the field of concurrency theory, is the first to adopt this new approach.
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.
Concurrency Theory is a synthesis of one of the major threads of theoretical computer science research focusing on languages and graphical notations for describing collections of simultaneously evolving components that interact through synchronous communication. The main specification notation focused on in this book is LOTOS. An extensive introduction to this particular process calculus is given, highlighting how the approach differs from competitor techniques, such as CCS and CSP.
The book covers linear-time semantics, based on traces; branching-time semantics, using both labeled transition systems and refusals; and true concurrency semantics, using (bundle) event structures. In addition, the book discusses communicating automata approaches (both finite and infinite state); how the theory can be generalised to the timed setting; and, finally, the authors generalise the (finite and infinite state) communicating automata notations to yield timed automata and discrete timed automata.
This book represents a comprehensive pass through the spectrum of concurrency theory research: From untimed to timed syntax and semantics and process calculi to automata. Researchers and practitioners in the field of concurrency theory, as well as MSc and PhD students, will find the comprehensive coverage in this book essential reading.
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)
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.
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)
Inhaltsverzeichnis
Introduction.-Background on Concurrency Theory.- Concurrency Theory, Untimed Models.- Process Caculi: 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 Communication Automata.- Timelocks in Timed Automata.- Discrete Timed Automata.
Klappentext
The book presents an extensive introduction to LOTOS highlighting how the approach differs from competitor techniques such as CCS and CSP. The notation is illustrated by a number of running examples and by using the LOTOS process calculus a spectrum of semantic models for concurrent systems are reviewed. Specifically, linear-time semantics; based on traces; branching-time semantics; using both labelled transition systems and refusals, are used to highlight true concurrency semantics using event structures.nnIn addition to this a simple timed extension to LOTOS is introduced using running examples, allowing consideration of how the untimed semantic models - traces, labelled transition systems, refusals and event structures - can be generalised to the timed setting. The authors also generalise the simple communicating automata notation to yield timed automata with multi-way synchronisation using model-checking verification methods and new techniques to prevent time-locks from arising.
The field of concurrency theory is becoming increasingly important, with the problem of formally verifying concurrent distributed systems a critical consideration and a major topic for the software industries. This book, with its extensive applications of the techniques involved in the field of concurrency theory, is the first to adopt this new approach.
