Concurrency Theory
Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Authors: Bowman, Howard, Gomez, Rodolfo
Free PreviewBuy this book
- About this book
-
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.
- 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)
- Table of contents (13 chapters)
-
-
Background on Concurrency Theory
Pages 3-13
-
Process Calculi: LOTOS
Pages 19-54
-
Basic Interleaved Semantic Models
Pages 55-104
-
True Concurrency Models: Event Structures
Pages 105-139
-
Testing Theory and the Linear Time — Branching Time Spectrum
Pages 141-180
-
Table of contents (13 chapters)
- Download Preface 1 PDF (143.8 KB)
- Download Sample pages 2 PDF (329.3 KB)
- Download Table of contents PDF (58.1 KB)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Concurrency Theory
- Book Subtitle
- Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
- Authors
-
- Howard Bowman
- Rodolfo Gomez
- Copyright
- 2006
- Publisher
- Springer-Verlag London
- Copyright Holder
- Springer-Verlag London
- eBook ISBN
- 978-1-84628-336-9
- DOI
- 10.1007/1-84628-336-1
- Hardcover ISBN
- 978-1-85233-895-4
- Softcover ISBN
- 978-1-84996-951-2
- Edition Number
- 1
- Number of Pages
- XX, 422
- Number of Illustrations
- 126 b/w illustrations
- Topics
