Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems [Hardcover]

Howard Bowman (Author), Rodolfo Gomez (Author)

Book Description

ISBN-10: 1852338954 | ISBN-13: 978-1852338954 | Publication Date: December 8, 2005 | Edition: 1st Edition.

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. In 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.

Editorial Reviews

Review

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 Back Cover

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.

Product Details

• Hardcover: 442 pages
• Publisher: Springer; 1st Edition. edition (December 8, 2005)
• Language: English
• ISBN-10: 1852338954
• ISBN-13: 978-1852338954
• Product Dimensions: 9.2 x 6.1 x 1 inches
• Shipping Weight: 1.7 pounds (View shipping rates and policies)
• Amazon Best Sellers Rank: #3,060,464 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.