Modelling Distributed Systems / by Wan Fokkink.

Por:

Fokkink, Wan [autor]

Colaborador(es):

SpringerLink (Servicio en línea)

Tipo de material: Texto

TextoSeries Texts in Theoretical Computer Science An EATCS SeriesEditor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Descripción: recurso en líneaTipo de contenido:

texto

Tipo de medio:

computadora

Tipo de portador:

recurso en línea

ISBN:

9783540739388

Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:

QA8.9-QA10.3

Recursos en línea:

Conectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)

Contenidos:

Abstract Data Types -- Process Algebra -- Hiding Internal Transitions -- Protocol Specifications -- Linear Process Equations -- Verification Algorithms on State Spaces -- Symbolic Methods.

Resumen: A 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.

Existencias ( 0 )
Notas de título ( 4 )

No hay ítems correspondientes a este registro

Springer eBooks

Abstract Data Types -- Process Algebra -- Hiding Internal Transitions -- Protocol Specifications -- Linear Process Equations -- Verification Algorithms on State Spaces -- Symbolic Methods.

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

Para consulta fuera de la UANL se requiere clave de acceso remoto.