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

This post was published 5 years ago. Download links are most likely obsolete.
If that's the case, try asking the author to reupload.

Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems (Repost)
Howard Bowman, Rodolfo Gomez, "Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems"
2005 | pages: 444 | ISBN: 1852338954 | PDF | 7,4 mb


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.

No comments have been posted yet. Please feel free to comment first!

    Load more replies

    Join the conversation!

    Login or Register
    to post a comment.