Concurrency Theory, Calculi and Automata for Modelling Untimed and Timed Concurrent Systems

Bowman, H. and Gomez, R.S. (2006) Concurrency Theory, Calculi and Automata for Modelling Untimed and Timed Concurrent Systems. Springer, London, 459 pp. ISBN 1-85233-895-4. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

Abstract

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.

Item Type: Book
Uncontrolled keywords: Process Calculi, Timed Automata, Labelled Transition Systems, Event Structures, Model Checking, Real-time Systems
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:04
Last Modified: 06 Jul 2009 13:41
Resource URI: http://kar.kent.ac.uk/id/eprint/14506 (The current URI for this page, for reference purposes)
  • Depositors only (login required):