Skip to main content
SpringerLink
Log in

Petri net based verification of distributed algorithms: An example

  • Published:
Formal Aspects of Computing

Abstract

A technique to model and to verify distributed algorithms is suggested. This technique (based on Petri nets) reduces the modelling and analysis effort to a reasonable level. The paper outlines the technique using the example of a typical network algorithm, theecho algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abadi, M.: An axiomatization of Lamport's temporal logic of actions. SRC Research Report 65, Digital Equipment Corporation, Systems Research Center, October 1990.

  2. Apt, K. R. and Olderog, E.-R.:Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science. Springer-Verlag, 1991.

  3. Best, E., Devillers, R. and Hall, F. G.: The box calculus: A new causal algebra with multi-label communication. In G. Rozenberg, editor,Advances in Petri nets 1992, volume 609 ofLNCS, pages 21–69. Springer-Verlag, 1992.

  4. Best, E. and Grahlmann, B.: ProjectPEP. http://www.informatik.unihildesheim.de/ pep/HomePage.html.

  5. Bougé, L.: Modularité et symétrie pour les systèmes répartis; application au langage CSP. Rapport de Recherche 87-2, Lab. d'Informatique de L'Ecole Normale Superieure, Paris, 1987.

  6. Cuéllar, J., Barnard, D. and Huber, M.: A solution relying on the model checking of boolean transition systems. In M. Broy, S. Merz and K. Spies, editors, Formal Systems Specification, The RPC-Memory Specification Case Study, LNCS 1169.

  7. Chang, E. J. H.: Echo algorithms: Depth parallel operations on general graphs.IEEE Transactions on Software Engineering, SE-8(4):391–401, 1982.

    Google Scholar 

  8. Chandy, K. M. and Misra, J.:Parallel Program Design: A Foundation. Addison-Wesley, 1988.

  9. Desel, J., Neuendorf, K.-P. and Radola, M.-D.: Proving nonreachability by moduloinvariants.Theoretical Computer Science, 153:49–64, 1996.

    Google Scholar 

  10. Dijkstra, E. W. and Scholten, C. S.: Diffusing computations.Information Processing Letters, 1981.

  11. Grahlmann, B. and Best, E.: PEP — more than a Petri net tool. In T. Margaria and B. Steffen, editors,Tools and Algorithms for the Construction and Analysis of Systems,TACAS, LNCS 1055, pp. 397–401. Springer-Verlag, March 1996.

  12. Gallager, R. G. A., Humblet, P. and Spira, M.: A distributed algorithm for minimumweight spanning trees.ACM Transactions on Programming Languages and Systems, 5(1):66–77, 1983.

    Google Scholar 

  13. Jensen, K.:Coloured Petri Nets, volume 1 ofEATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1992.

  14. Kindler, E. and Walter, R.: Message passing mutex. In Jörg Desel, editor,Structures in Concurrency Theory, Workshops in Computing, pages 205–219. Berlin, Springer-Verlag, May 1995.

    Google Scholar 

  15. Lamport, L.: The temporal logic of actions. SRC Research Report 79, Digital Equipment Corporation, Systems Research Center, December 1991.

  16. Lynch, N. and Tuttle, M.: An introduction to input/output automata.CWI-Quarterly, 3(2):219–246, 1989.

    Google Scholar 

  17. Lynch, N. A.:Distributed Algorihms. Morgan Kaufmann, 1996.

  18. Reisig, W.: Petri net models of distributed algorithms. In Jan van Leeuwen, editor,Computer Science Today: Recent Trends and Developments, LNCS 1000, pp. 441–454. Springer-Verlag, 1995.

  19. Reisig, W.: Modelling and verification of distributed algorithms. In Ugo Montanari and Vladimiro Sassone, editors,CONCUR'96: Concurrency Theory, LNCS 1119, pp. 579–595. Springer-Verlag, 1996.

  20. Raynal, M. and Helary, J.-M.:Synchronization and Control of Distributed Systems and Programs. Series in parallel computing. Wiley, 1990.

  21. Stomp, F. A. and de Roever, W. P.: A principle for sequential phased reasoning about distributed algorithms.Formal Aspects of Computing, 6:716–737, 1994.

    Google Scholar 

  22. Segall, A.: Distributed network protocols.IEEE Transactions on Information Theory, IT29-1:23–35, 1983.

    Google Scholar 

  23. Shavit, N. and Francez, N.: A new approach to detection of locally indicative stability. In L. Kott, editor,Proc. of th 13th ICALP, LNCS 226, pp. 344–358. Springer-Verlag, 1986.

  24. Tel, G.:Introduction to Distributed Algorithms. Cambridge University Press, 1994.

  25. Walter, R., Völzer, H., Vesper, T., Reisig, W., Kindler, E., Freiheit, J. and Desel, J.: Memorandum: Petrinetzmodelle zur Verifikation Verteilter Algorithmen. Informatik-Bericht 67, Humboldt-Universität zu Berlin, July 1996.

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, D-10099, Berlin, Germany

    Ekkart Kindler, Wolfgang Reisig & Hagen Völzer

  2. Fraunhofer Institute for Software and Systems Engineering, Berlin, Germany

    Rolf Walter

Authors
  1. Ekkart Kindler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Reisig
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hagen Völzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rolf Walter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hagen Völzer.

Additional information

Supported by the DFG-projects ”Verteilte Algorithmen” and ”Konsensalgorithmen”

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kindler, E., Reisig, W., Völzer, H. et al. Petri net based verification of distributed algorithms: An example. Formal Aspects of Computing 9, 409–424 (1997). https://doi.org/10.1007/BF01211299

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01211299

Keywords

Search

Navigation