Concurrency Theory

Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

By Howard Bowman , Rodolfo Gomez

Concurrency Theory Cover Image

  • ISBN13: 978-1-8523-3895-4
  • 442 Pages
  • User Level: Science
  • Publication Date: February 28, 2006
  • Available eBook Formats: PDF
  • eBook Price: $129.00
Buy eBook Buy Print Book Add to Wishlist

Related Titles

Full Description
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.
Table of Contents

Table of Contents

  1. Introduction.
  2. Background on Concurrency Theory.
  3. Concurrency Theory, Untimed Models.
  4. Process Caculi: LOTOS.
  5. Basic Interleaved Semantic Models.
  6. True Concurrency Models: Event Structures.
  7. Testing Theory and the Linear Time, Branching Time Spectrum.
  8. Concurrency Theory – Further Untimed Notations.
  9. Beyond pbLOTOS.
  10. Comparison of LOTOS with CCS and CSP.
  11. Communicating Automata.
  12. Concurrency Theory – Timed Models.
  13. Timed Process Calculi, a LOTOS Perspective, Semantic Models for tLOTOS.
  14. Timed Communication Automata.
  15. Timelocks in Timed Automata.
  16. Discrete Timed Automata.
Errata

Please Login to submit errata.

No errata are currently published