Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | 30000010176138 | QA76.58 F64 2007 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
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.
Table of Contents
| 1 Introduction | p. 1 |
| 2 Abstract Data Types | p. 5 |
| 2.1 Algebraic Specification | p. 5 |
| 2.2 Term Rewriting | p. 9 |
| 2.3 Equality Functions | p. 10 |
| 2.4 Induction | p. 11 |
| 3 Process Algebra | p. 13 |
| 3.1 Actions | p. 13 |
| 3.2 Alternative and Sequential Composition | p. 14 |
| 3.3 Parallel Processes | p. 16 |
| 3.4 Deadlock and Encapsulation | p. 18 |
| 3.5 Process Declarations | p. 21 |
| 3.6 Conditionals | p. 22 |
| 3.7 Summation over a Data Type | p. 22 |
| 3.8 An Example: The Bag | p. 24 |
| 3.9 Renaming | p. 25 |
| 3.10 Bisimilarity | p. 25 |
| 4 Hiding Internal Transitions | p. 29 |
| 4.1 Hiding of Actions | p. 29 |
| 4.2 Summary | p. 30 |
| 4.3 An Example: Two One-Bit Buffers in Sequence | p. 31 |
| 4.4 Branching Bisimilarity | p. 34 |
| 5 Protocol Specifications | p. 41 |
| 5.1 Alternating Bit Protocol | p. 41 |
| 5.2 Bounded Retransmission Protocol | p. 45 |
| 5.3 Sliding Window Protocol | p. 52 |
| 5.4 Tree Identify Protocol | p. 57 |
| 5.5 Movable Patient Support for an MRI Scanner | p. 63 |
| 6 Linear Process Equations | p. 69 |
| 6.1 Linearisation | p. 70 |
| 6.2 State Space Generation and Storage | p. 74 |
| 6.3 CL-RSP | p. 76 |
| 6.4 Invariants | p. 77 |
| 7 Verification Algorithms on State Spaces | p. 81 |
| 7.1 Minimisation Modulo Branching Bisimulation | p. 81 |
| 7.2 Confluence | p. 83 |
| 7.3 Model Checking | p. 86 |
| 7.4 Abstraction | p. 94 |
| 8 Symbolic Methods | p. 101 |
| 8.1 Cones and Foci | p. 101 |
| 8.2 Verification of the Tree Identify Protocol | p. 104 |
| 8.3 Partial Order Reduction | p. 107 |
| 8.4 Elimination of Parameters and Sum Variables | p. 112 |
| 8.5 Symbolic Model Checking | p. 116 |
| A The [mu]CRL Toolset in a Nutshell | p. 125 |
| Solutions to Exercises | p. 131 |
| References | p. 143 |
| Index | p. 149 |
