000 03411nam a22003735i 4500
001 297279
003 MX-SnUAN
005 20160429155416.0
007 cr nn 008mamaa
008 150903s2007 gw | o |||| 0|eng d
020 _a9783540739388
_99783540739388
024 7 _a10.1007/9783540739388
_2doi
035 _avtls000350715
039 9 _a201509030419
_bVLOAD
_c201405060239
_dVLOAD
_y201402171104
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA8.9-QA10.3
100 1 _aFokkink, Wan.
_eautor
_9332939
245 1 0 _aModelling Distributed Systems /
_cby Wan Fokkink.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2007.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aTexts in Theoretical Computer Science An EATCS Series,
_x1862-4499
500 _aSpringer eBooks
505 0 _aAbstract Data Types -- Process Algebra -- Hiding Internal Transitions -- Protocol Specifications -- Linear Process Equations -- Verification Algorithms on State Spaces -- Symbolic Methods.
520 _aA distributed system is driven by separate components that are executed in parallel, and protocols for such systems form a major aspect of system design in today’s world of wireless and mobile networking. Process algebras are languages for the description of elementary parallel systems and are used to study the behavioural properties of distributed systems, but they often lack the ability to handle data. This textbook guides students through algebraic specification and verification of distributed systems, and some of the most prominent formal verification techniques. The author employs µCRL as the vehicle, a language developed to combine process algebra and abstract data types. Chapters 2 and 3 explain the basics of abstract data types and process algebra, and guide the reader through the syntax and semantics of µCRL; Chap. 4 examines abstraction from internal behaviour; Chap. 5 covers specifications of standard protocols; Chap. 6 shows how to transform protocol specifications into labelled transition systems; Chap. 7 explains algorithms on labelled transition systems; and Chap. 8 presents symbolic verification techniques; finally, the Appendix gives a brief overview of the µCRL toolset. The book evolved from introductory courses on protocol verification taught to undergraduate and graduate students of computer science, and the text is supported throughout with examples and exercises; full solutions are provided in an appendix, while exercise sheets, lab exercises, example specifications and lecturer slides will be available on the author's website. Researchers in the field can use the book as a broad overview of the state of the art in algebraic specification and verification of distributed systems on the basis of a modern verification tool.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540739371
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-73938-8
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c297279
_d297279