Concurrency Theory

Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

AvHoward Bowman,Rodolfo Gomez

Häftad, Engelska, 2010

1 610 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

1 640 kr

Skickas inom 10-15 vardagar

Beskrivning

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.

Produktinformation

Utgivningsdatum:2010-10-13
Mått:155 x 235 x 24 mm
Vikt:640 g
Format:Häftad
Språk:Engelska
Antal sidor:422
Förlag:Springer London Ltd
ISBN:9781849969512

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT

Recensioner i media

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)

Innehållsförteckning

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.