Modelling Distributed Systems

Portada
Springer Science & Business Media, 2007 M09 5 - 154 páginas

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.

Dentro del libro

Páginas seleccionadas

Contenido

Introduction
1
Process Algebra
13
Hiding Internal Transitions
29
Protocol Specifications
41
Linear Process Equations 69
68
Verification Algorithms on State Spaces
81
Symbolic Methods
101
A The μCRL Toolset in a Nutshell
125
References
143
Index
149
Derechos de autor

Otras ediciones - Ver todas

Términos y frases comunes

Pasajes populares

Página 27 - Vector addition, for example, is commutative and associative, X + Y = Y + X and x + (Y + z) = (x + Y) + z...
Página 21 - ... process term possibly containing occurrences of expressions Y(di, . . . , dm), where Y is a process name and the d^ are data terms that may contain occurrences of the variables xi, . . . , xn. In this rule, X(xi, .... xn) is declared to have the same (potential) behavior as the process expression t [19].
Página 21 - The initial state of the specification is declared in a separate initial declaration init section, which is of the form init X(di, ..., dn) Here (di, . . . , dn) represents the initial behavior of the system that is being described.
Página 19 - Sometimes, we want to express that certain actions cannot happen, and must be blocked, ie renamed to 8.
Página 21 - Moreover, t is a process term possibly containing occurrences of expressions Y(di, . . . ,dm), where Y is a process name and the di are data terms that may contain occurrences of the variables xi,...,xn.

Referencias a este libro

Información bibliográfica