Skip to main content
SpringerLink
Log in
Book cover

Theory and Practice in Distributed Systems pp 164–177Cite as

Correctness proofs of distributed algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 938))

Abstract

Techniques to model and to analyze distributed algorithms are suggested. Those techniques (based on Petri Nets) respect and exploit particular features and concepts of distributed systems, thus reducing the modelling- and analysis effort to a reasonable expenditure. The paper outlines such techniques by various examples and algorithms.

Extended version of a contribution to the Dagstuhl Workshop ”Unifying Theory and Practise in Distributed Systems”, Sept. 1994

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R: Apt, E.-R. Olderog: Verification of Sequential and Concurrent Programs. Springer-Verlag (1991)

    Google Scholar 

  2. K.M. Chandy, J. Misra: Parallel Program Design: A foundation. Addison-Wesley (1988)

    Google Scholar 

  3. Zohar Manna, Amir Pnueli: The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag (1992)

    Google Scholar 

  4. G.L. Peterson: Myths about mutual exclusion algorithms. Information Processing Letters 12(3), pp115–116, (1981)

    Google Scholar 

  5. Michel Raynard: Distributed Algorithms and Protocols. J. Wiley & sons (1988)

    Google Scholar 

  6. Wolfgang Reisig: Petri Nets. Springer Verlag (1984)

    Google Scholar 

  7. Wolfgang Reisig: Formal Methods for Concurrent System Design: A Survey. Invited paper, in Giloi, Jähnichen, Shriver (eds): Programming Models for Massively Parallel Computers. Computer Society Press (1993)

    Google Scholar 

  8. Wolfgang Reisig: Progress in Petri Nets. Theoretical Computer Science, 1995, to appear

    Google Scholar 

  9. F.A. Stomp, W.-P. de Roever: Principles for sequential reasoning about distributed algorithms. Formal Aspects of Computing 3, pp 1–71 (1994)

    Google Scholar 

  10. Gerard Tel: Distributed Algorithms. Cambridge Internat. Series on Parallel Computation 1. Cambridge University Press (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Humboldt-Universität zu Berlin, Deutschland

    W. Reisig

Authors
  1. W. Reisig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kenneth P. Birman Friedemann Mattern André Schiper

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reisig, W. (1995). Correctness proofs of distributed algorithms. In: Birman, K.P., Mattern, F., Schiper, A. (eds) Theory and Practice in Distributed Systems. Lecture Notes in Computer Science, vol 938. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60042-6_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-60042-6_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60042-8

  • Online ISBN: 978-3-540-49409-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation