Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Autor Howard Bowman, Rodolfo Gomezen Limba Engleză Paperback – 13 oct 2010
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 966.53 lei 6-8 săpt. | |
SPRINGER LONDON – 13 oct 2010 | 966.53 lei 6-8 săpt. | |
Hardback (1) | 972.74 lei 6-8 săpt. | |
SPRINGER LONDON – 21 dec 2005 | 972.74 lei 6-8 săpt. |
Preț: 966.53 lei
Preț vechi: 1208.16 lei
-20% Nou
Puncte Express: 1450
Preț estimativ în valută:
184.99€ • 192.81$ • 153.100£
184.99€ • 192.81$ • 153.100£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781849969512
ISBN-10: 1849969515
Pagini: 422
Ilustrații: XX, 422 p. 126 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.64 kg
Ediția:Softcover reprint of hardcover 1st ed. 2006
Editura: SPRINGER LONDON
Colecția Springer
Locul publicării:London, United Kingdom
ISBN-10: 1849969515
Pagini: 422
Ilustrații: XX, 422 p. 126 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.64 kg
Ediția:Softcover reprint of hardcover 1st ed. 2006
Editura: SPRINGER LONDON
Colecția Springer
Locul publicării:London, United Kingdom
Public țintă
ResearchCuprins
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.
Recenzii
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)
"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)
Textul de pe ultima copertă
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.
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.
Caracteristici
First book to adopt the approach taken by the LOTOS process calculi and its theory Combines timed automata with region graph based model-checking – a highly topical approach Includes supplementary material: sn.pub/extras