Concurrency Theory : Calculi and Automata for Modelling Untimed and Timed Concurrent Systems /
By: Bowman, Howard [author.].
Contributor(s): Gomez, Rodolfo [author.] | SpringerLink (Online service).
Material type:
BookPublisher: London : Springer London, 2006.Description: XX, 422 p. 126 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9781846283369.Subject(s): Computer science | Software engineering | Computers | Computer logic | Computer Science | Theory of Computation | Software Engineering | Logics and Meanings of ProgramsDDC classification: 004.0151 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
E books
|
PK Kelkar Library, IIT Kanpur | Available | EBK344 |
Background on Concurrency Theory -- Concurrency Theory — Untimed Models -- Process Calculi: LOTOS -- Basic Interleaved Semantic Models -- True Concurrency Models: Event Structures -- Testing Theory and the Linear Time — Branching Time Spectrum -- Concurrency Theory — Further Untimed Notations -- Beyond pbLOTOS -- Comparison of LOTOS with CCS and CSP -- Communicating Automata -- Concurrency Theory — Timed Models -- Timed Process Calculi, a LOTOS Perspective -- Semantic Models for tLOTOS -- Timed Communicating Automata -- Timelocks in Timed Automata -- Discrete Timed Automata.
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.
There are no comments for this item.