Elements of Distributed Algorithms: Modeling and Analysis With Petri Nets

Wolfgang Reisig

ISBN 10: 3540627529 / ISBN 13: 9783540627524

Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1998

Ancien livre de bibliothèque. Edition 1998. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1998. Ammareal gives back up to 15% of this item's net price to charity organizations. Bestandsnummer des Verkäufers E-577-818

Inhaltsangabe:

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.

Von der hinteren Coverseite: 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.

Bibliografische Details

Titel: Elements of Distributed Algorithms: Modeling...
Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Erscheinungsdatum: 1998
Einband: Hardcover
Zustand: Très bon