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.
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
Book Description
Editorial Reviews
From the Back Cover
Since the introduction of Hoares' Communicating Sequential Processes notation, powerful new tools have transformed CSP into a practical way of describing industrial-sized problems. This book gives you the fundamental grasp of CSP concepts you'll need to take advantage of those tools.Part I provides a detailed foundation for working with CSP, using as little mathematics as possible. It introduces the ideas behind operational, denotational and algebraic models of CSP. Parts II and III go into greater detail about theory and practice. Topics include: parallel operators, hiding and renaming, piping and enslavement, buffers and communication, termination and sequencing, and semantic theory. Three detailed practical case studies are also presented.For anyone interested in modeling sequential processes.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
6 of 7 people found the following review helpful:
5.0 out of 5 stars
The definitive work on modern CSP,
This review is from: Theory and Practice of Concurrency (Textbook Binding)
CSP is a process algebra (i.e. a mathematical theory of concurrency) developed by Tony Hoare (creator of the quicksort algorithm, and the notion of monitors for concurrent programming, among other things) for reasoning about concurrent systems. The theory of CSP provides practitioners with a framework for understanding concurrent, multi-threaded, and distributed systems, and the analytical tools necessary to ensure those systems are free of deadlock and livelock, and function correctly. Bill Roscoe's text is THE definitive work on modern CSP. Absolutely necessary for anyone who is serious about understanding and using CSP to specify, design, analyze, or think about any kind of concurrent system.
The book is broken roughly into thirds. The first third introduces the fundamentals of CSP, in a very readable fashion. The middle third covers the underlying theory of CSP, including all of the semantic models (denotational, algebraic, and operational). It's much heavier going than the first third, but is an invaluable reference for the finer points of CSP semantics. The last third of the book examines some practical applications of CSP, including network deadlock analysis and security protocol analysis. It is again very readable, and also presents some key ideas in the use of automatic verification tools with CSP. Working through the whole book will provide readers with a great foundation for understanding both the practicalities of specification and verification with CSP, and recently published theoretical results.
1 of 2 people found the following review helpful:
5.0 out of 5 stars
The best book to learn CSP,
By
This review is from: Theory and Practice of Concurrency (Textbook Binding)
The best textbook for learning CSP. Dr. Hoare's original book is like a reference. This book explains concepts way better.
Share your thoughts with other customers: Create your own review
|
|
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
