Elements of Distributed Algorithms : Modeling and Analysis with Petri Nets

Wolfgang Reisig

ISBN 10: 3540627529 / ISBN 13: 9783540627524

Verlag: Springer Berlin Heidelberg, 1998

Beschreibung

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. Bestandsnummer des Verkäufers 9783540627524

Bibliografische Details

Titel: Elements of Distributed Algorithms : ...

Verlag: Springer Berlin Heidelberg

Erscheinungsdatum: 1998

Einband: Buch

Zustand: Neu

Über diesen Titel

Inhaltsangabe:

Book by Reisig Wolfgang

Reseña del editor:

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.