|
![]() |
|||
|
||||
OverviewThe 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. Full Product DetailsAuthor: Howard Bowman , Rodolfo GomezPublisher: Springer London Ltd Imprint: Springer London Ltd Edition: Softcover reprint of hardcover 1st ed. 2006 Dimensions: Width: 15.50cm , Height: 2.30cm , Length: 23.50cm Weight: 0.700kg ISBN: 9781849969512ISBN 10: 1849969515 Pages: 422 Publication Date: 13 October 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsBackground 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.ReviewsFrom 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) "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)" 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) Author InformationTab Content 6Author Website:Countries AvailableAll regions |