Elements of Distributed Algorithms

Distributed algorithms, essential to networks of all kinds, are presented using the highly intuitive and technically elegant Petri net technique in this text for students and practitioners. A variety of distributed algorithms are presented, and proven correct using temporal logic.

Distributed Computing is becoming more and more important for the application and organization of computing systems This book uses a Petri net and temporal logic approach to present a variety of distributed algorithms and prove their correctness in the simplest possible way The author is one of the world's leading authorities on Petri nets

Auteur
Prof. Dr. Wolfgang Reisig is a professor at Humboldt Universität zu Berlin, Germany. He has over 30 years experience in the theory, applications, and teaching of Petri nets and related techniques; and he has been closely involved in the key community initiatives such as related conferences. Among his books are titles in the areas of Petri nets, distributed algorithmsm, and computational systems biology.

Contenu
I. Elementary Concepts.- II. Case Studies.- III. Advanced Concepts.- IV. Case Studies.- V. Case Studies Continued: Acknowledged Messages.- VI. Case Studies Continued: Network Algorithms.- VII. State Properties of Elementary System Nets.- VIII. Interleaved Progress of Elementary System Nets.- IX. Concurrent Progress of Elementary System Nets.- X. State Properties of System Nets.- XI. Interleaved Progress of System Nets.- XII. Concurrent Progress of System Nets.- XIII. Formal Analysis of Case Studies.- References.