The theory and practice of concurrency
著者
書誌事項
The theory and practice of concurrency
（Prentice Hall series in computer science）
Prentice Hall, 1998
大学図書館所蔵 件 / 全9件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliography(p.543-550) and index
内容説明・目次
内容説明
Since Professor Hoare's book Communicating Sequential Processes was first published, his notation has been extensively used for teaching and applying concurrency theory. The most significant development since then has been the emergence of tools to support the teaching and industrial application of CSP. This has turned CSP from a notation used mainly for toy examples into one which can and does support the description of industrial-sized problems. In order to understand the tools you need a good grasp of the fundamental concepts of CSP, therefore the book is, in the first instance, a text on the principles of the language rather than being a manual on how to apply its tools.
The Theory and Practice of Concurrency is divided into 3 sections. Part I is a foundation course on CSP, covering essentially the same material as the Hoare book, except that most of the mathematical theory has been omitted. It introduces the ideas behind the operational, denotational and algebraic models of CSP. Parts II and III go into more detail about the theory and practice of CSP. Either of them would make a one semester course or though they are independent of each other.
This book assumes no mathematical knowledge except for a basic understanding of sets, sequences and functions. Part I and III use no sophisticated mathematics, and the extra amount needed for Part II is contained within Appendix A (which introduces the theory of partial order and metric/restriction spaces).
The book brings substantial new insights into the important subjects of computer security, fault tolerance, real-time modelling, communications protocols and distributed databases. Each of these is supported by a case study and guidance on how to apply automated analysis to verify systems.
目次
Introduction.
1. Fundamental Concepts
2. Parallel Operators.
3. Hiding and Renaming.
4. Piping and Enslavement.
5. Buffers and Communication.
6. Termination and Sequencing.
7. Operational Semantics.
8. Denontational Semantics.
9. Analysing the Denotational Models.
10. Infinite Traces.
11. Algebraic Semantics.
12. Abstraction.
13. Deadlock!
14. Modelling Discrete Time.
15. Case Studies.
Appendix Mathematical Background
A Guide to Machine Readable CSP.
The Operation of FDR.
「Nielsen BookData」 より
