All Book Download | Introduction to Process Algebra |
\Automated and semi-automated manipulation of so called labelled transition systems has become an important means in discovering flaws in software and hardware systems. Process algebra has been developed to express such labelled transition systems algebraically, which enhances the ways of manipulation by means of equational logic and term rewriting. The theory of process algebra has developed rapidly over the last twenty years, and verification tools have been developed on the basis of process algebra, often in cooperation with techniques related to model checking. This textbook gives a thorough introduction into the basics of process algebra and its applications.
The book is set up as follows. Chapter 2 introduces basic process algebra, which can express finite process graphs; an equational logic is presented that is sound and complete modulo bisimulation equivalence. Chapter 3 features merge operators to express processes that are executed in parallel. Chapter 4 defines recursion to describe infinite process behaviour. Chapter 5 explains how to abstract away from internal computations. Chapter 6 applies the framework from the previous chapters to verify the correctness of two network protocols. Furthermore, it gives an overview of existing techniques and automated tools to support such verification efforts. Chapter 7 gives examples of further operators that can be added to the framework. Appendices A and B provide background material for the theory developed in the earlier chapters. Appendix A presents the basics of equational logic, while Appendix B gives an overview of structural operational semantics.
The book is set up as follows. Chapter 2 introduces basic process algebra, which can express finite process graphs; an equational logic is presented that is sound and complete modulo bisimulation equivalence. Chapter 3 features merge operators to express processes that are executed in parallel. Chapter 4 defines recursion to describe infinite process behaviour. Chapter 5 explains how to abstract away from internal computations. Chapter 6 applies the framework from the previous chapters to verify the correctness of two network protocols. Furthermore, it gives an overview of existing techniques and automated tools to support such verification efforts. Chapter 7 gives examples of further operators that can be added to the framework. Appendices A and B provide background material for the theory developed in the earlier chapters. Appendix A presents the basics of equational logic, while Appendix B gives an overview of structural operational semantics.
Related Posts :
0 komentar:
Posting Komentar