In this textbook a variety of distributed algorithms are presented independently of particular programming languages or hardware, using the graphically suggestive technique of Petri nets which is both easy to comprehend intuitively and formally rigorous. By means of temporal logic the author provides surprisingly simple yet powerful correctness proofs for the algorithms.
The scope of the book ranges from distributed control and synchronization of two sites up to algorithms on any kind of networks. Numerous examples show that description and analysis of distributed algorithms in this framework are intuitive and technically transparent.
In this textbook a variety of distributed algorithms are presented independently of particular programming languages or hardware, using the graphically suggestive technique of Petri nets which is both easy to comprehend intuitively and formally rigorous. By means of temporal logic the author provides surprisingly simple yet powerful correctness proofs for the algorithms.
The scope of the book ranges from distributed control and synchronization of two sites up to algorithms on any kind of networks. Numerous examples show that description and analysis of distributed algorithms in this framework are intuitive and technically transparent.

Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets
302
Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets
302Paperback(Softcover reprint of the original 1st ed. 1998)
Product Details
ISBN-13: | 9783642083037 |
---|---|
Publisher: | Springer Berlin Heidelberg |
Publication date: | 12/01/2010 |
Edition description: | Softcover reprint of the original 1st ed. 1998 |
Pages: | 302 |
Product dimensions: | 6.10(w) x 9.25(h) x 0.24(d) |