Elements of Distributed Algorithms : Modeling and Analysis with Petri Nets

Wolfgang Reisig

ISBN 10: 364208303X / ISBN 13: 9783642083037

Published by Springer Berlin Heidelberg, 2010

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783642083037

Bibliographic Details

• Title: Elements of Distributed Algorithms : Modeling and Analysis with Petri Nets
• Publisher: Springer Berlin Heidelberg
• Publication Date: 2010
• Language: English
• ISBN 10: 364208303X
• ISBN 13: 9783642083037
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

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.

From the Back Cover

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.