Skip to main content

Elements of Distributed Algorithms

Modeling and Analysis with Petri Nets

  • Textbook
  • © 1998

Overview

  • 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

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 59.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 44.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (14 chapters)

  1. Introduction

  2. Elementary System Models

  3. Advanced System Models

  4. Analysis of Elementary System Models

  5. Analysis of Advanced System Models

Keywords

About this book

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.

Authors and Affiliations

  • Institut für Informatik, Humboldt-Universität zu Berlin, Berlin, Germany

    Wolfgang Reisig

Bibliographic Information

Publish with us