Delivery included to the United States

Elements of Distributed Algorithms : Modeling and Analysis with Petri Nets

Elements of Distributed Algorithms : Modeling and Analysis with Petri Nets

Softcover reprint of the original 1st ed. 1998

Paperback (09 Dec 2010)

Save $4.06

  • RRP $49.21
  • $45.15
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's Synopsis

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.

Book information

ISBN: 9783642083037
Publisher: Springer Berlin Heidelberg
Imprint: Springer
Pub date:
Edition: Softcover reprint of the original 1st ed. 1998
DEWEY: 004.36
DEWEY edition: 22
Language: English
Number of pages: 302
Weight: 486g
Height: 234mm
Width: 156mm
Spine width: 16mm