Distributed Computing is rapidly becoming the principal computing paradigm in diverse areas of computing, communication, and control. Processor clusters, local and wide area networks, and the information highway evolved a new kind of problems which can be solved with distributed algorithms.
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.
|The Petri Net Approach|
|Elementary System Models: Elementary Concepts|
|Advanced System Models: Advanced Concepts|
|Analysis of Elementary System Models: State Properties of Elementary System Nets|
|Interleaved Progress of Elementary System Nets|
|Concurrent Progress of Elementary System Nets|
|Analysis of Advanced System Models: State Properties of System Nets|
|Interleaved Progress of System Nets|
|Concurrent Progress of System Nets|
|Formal Analysis of Case Studies|
|Table of Contents provided by Publisher. All Rights Reserved.|
Number Of Pages: 302
Published: 20th August 1998
Publisher: SPRINGER VERLAG GMBH
Country of Publication: DE
Dimensions (cm): 24.16 x 16.31 x 2.34
Weight (kg): 0.54