Modelling and verification of Distributed Algorithms

  • Wolfgang Reisig
Invited Talk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1119)


Distributed Algorithms are frequently published in informal or semiformal representations and are often informally verified. Formal approaches frequently extend classical algorithmic concepts. This yields frequently clumsy and unnecessarily compilated representations.

We suggest integrated representation- and verification concepts, tailored for Distributed Algorithms. They respect and exploit basic characteristic features of Distributed Algorithms, such as local causes and effects of actions, and synchronization of control strands.

The approach aims at an optimal compromize of technical simplicity and conceptual adequacy for a wide class of Distributed Algorithms, in analogy to the simplicity and adequacy of Pascal and Hoare Logic for a wide class of sequential algorithms. A number of case studies shows the adequacy of the approach.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E. Best: Semantik. Vieweg-Verlag Braunschweig (1995)Google Scholar
  2. 2.
    E. W. Dijkstra: Finding the Correctness Proof of a Concurrent Program. Proc. Koninklijke Nederlandse Akademie van Wetenschappen, Vol 81/2, pp 207–215 (June 1978)Google Scholar
  3. 3.
    E. Kindler: Modularer Entwurf verteilter Systeme mit Petrinetzen. Edition Versal, Bertz-Verlag (1995)Google Scholar
  4. 4.
    S. Owicki, L. Lamport: Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems 4, pp 455–495 (1982)Google Scholar
  5. 5.
    W. Reisig: Petri Nets and Algebraic Specifications. Theoretical Computer Science 80, pp 1–34 (1991)Google Scholar
  6. 6.
    W. Reisig: Correctness Proofs of Distributed Algorithms. in: K. P. Birman et al (eds): Theory and Practice in Distributed Systems. LNCS 938, pp 164–177, Springer-Verlag (1995)Google Scholar
  7. 7.
    W. Reisig: Petri Net Models of Distributed Algorithms. in: J. van Leeuven (ed): Computer Science Today: Recent Trends and Developments. LNCS 1000, pp 441–454, Springer-Verlag (1995)Google Scholar
  8. 8.
    W. Reisig: Interleaved Progress, Concurrent Progress and Local Progress. Proceedings of the DIMACS Workshop on Partial Order Methods in Verification. D. Peled, G. Holzmann, V. Pratt (eds), American Mathematical Society (to appear)Google Scholar
  9. 9.
    W. Reisig: Distributed Algorithms: Modelling and Analysis with Petri Nets. Monography (to appear)Google Scholar
  10. 10.
    R. Walter: Petrinetzmodelle verteilter Algorithmen. Edition Versal, Bertz-Verlag (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Wolfgang Reisig
    • 1
  1. 1.Humboldt University of BerlinGermany

Personalised recommendations