Cargando…

Concurrency Theory Calculi an Automata for Modelling Untimed and Timed Concurrent Systems /

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 focus...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Bowman, Howard (Autor), Gomez, Rodolfo (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Springer London : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-1-84628-336-9
003 DE-He213
005 20220114224106.0
007 cr nn 008mamaa
008 100301s2006 xxk| s |||| 0|eng d
020 |a 9781846283369  |9 978-1-84628-336-9 
024 7 |a 10.1007/1-84628-336-1  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
100 1 |a Bowman, Howard.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Concurrency Theory  |h [electronic resource] :  |b Calculi an Automata for Modelling Untimed and Timed Concurrent Systems /  |c by Howard Bowman, Rodolfo Gomez. 
250 |a 1st ed. 2006. 
264 1 |a London :  |b Springer London :  |b Imprint: Springer,  |c 2006. 
300 |a XX, 422 p. 126 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a 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. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Software Engineering. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
700 1 |a Gomez, Rodolfo.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9781848008052 
776 0 8 |i Printed edition:  |z 9781849969512 
776 0 8 |i Printed edition:  |z 9781852338954 
856 4 0 |u https://doi.uam.elogim.com/10.1007/1-84628-336-1  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)