000 03378nam a22004455i 4500
001 978-1-84628-336-9
003 DE-He213
005 20170628033852.0
007 cr nn 008mamaa
008 100301s2006 xxk| s |||| 0|eng d
020 _a9781846283369
_9978-1-84628-336-9
024 7 _a10.1007/1-84628-336-1
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aBowman, Howard.
_eauthor.
245 1 0 _aConcurrency Theory
_h[electronic resource] :
_bCalculi and Automata for Modelling Untimed and Timed Concurrent Systems /
_cby Howard Bowman, Rodolfo Gomez.
264 1 _aLondon :
_bSpringer London,
_c2006.
300 _aXX, 422 p. 126 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aBackground 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.
520 _aConcurrency 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aSoftware Engineering.
650 2 4 _aLogics and Meanings of Programs.
700 1 _aGomez, Rodolfo.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781852338954
856 4 0 _uhttp://dx.doi.org/10.1007/1-84628-336-1
912 _aZDB-2-SCS
999 _c17223
_d17223