Proving correctness of distributed algorithms using high-level Petri Nets - A case study

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn 1998-March, Issue , 1998, Pages 177-186

  Desel, Jörg ^a   Kindler, Ekkart ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH LEVEL LANGUAGES; MESSAGE PASSING; SYSTEMS ANALYSIS; TEMPORAL LOGIC;

CONNECTED NETWORKS; CORRECTNESS PROOFS; HIGH-LEVEL PETRI NETS; LOGIC STYLE; MESSAGE PASSING ALGORITHM; MUTUAL EXCLUSION ALGORITHMS; PETRI NET THEORIES;

PETRI NETS;

EID: 84958683229     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSD.1998.657550     Document Type: Conference Paper

References (24)

1. B. Alpern and F. B. Schneider, "Defining liveness", Information Processing Letters, vol. 21, pp. 181-185, Oct. 1985.
2. K. R. Apt, N. Francez, and S. Katz, "Appraising fairness in languages for distributed programming", Distributed Computing, vol. 2, pp. 226-241, 1988.
3. E. Best, Semantics of Sequential and Parallel Programs, Prentice Hall, 1996.
4. K. M. Chandy and J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988.
5. J. Desel, "How distributed algorithms play the token game", in Foundations of Computer Science - Potential, Theory, Cognition, C. Freksa, R. Valk and M. Jantzen , Eds., LNCS 1337, pp. 297-306, Springer-Verlag, 1997.
6. R. W. Floyd, "Assigning meanings to programs", in Mathematical Aspects of Computer Science, J.T. Schwartz, Ed. American Mathematical Society, Apr. 1966, Proceedings of Symposia in Applied Mathematics 19, pp. 19-32.
7. N. Francez, Fairness, Springer-Verlag, 1986.
8. D. Harel, Algorithmics: The Spirit of Computing, Addison- Wesley, 1992.
9. C. A. R. Hoare, "An axiomatic basis for computer programming", Communications of the ACM, vol. 12, no. 10, pp. 576-583, Oct. 1969.
10. K. Jensen, Coloured Petri Nets, Volume 1: Basic Concepts, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1992.
11. E. Jessen and R. Valk, Rechensysteme: Grundlagen der Modellbildung, Springer-Verlag, 1987.
12. R. M. Keller, "Formal verification of parallel programs", Communications of the ACM, vol. 19, no. 7, pp. 371-384, July 1976.
13. E. Kindler, Modularer Entwurf verteilter Systeme mit Petrinetzen, Edition Versal, Bertz Verlag, Dec. 1995, Dissertation, Technische Universität München.
14. E. Kindler and W. Reisig, "Algebraic system nets for modeling distributed algorithms", Petri Net Newsletter, vol. 51, pp. 16-31, Dec. 1996.
15. E. Kindler, W. Reisig, H. Völzer, and R. Walter, "Petri net based verification of distributed algorithms: An example", Accepted for Formal Aspects of Computing, to appear. (Also: Informatik-Bericht 63, Humboldt-Universität zu Berlin, May 1996).
16. E. Kindler and R. Walter, "Message passing mutex", in Structures in Concurrency Theory, J. Desel, Ed., Berlin, May 1995, Workshops in Computing, pp. 205-219, Springer-Verlag.
17. D. Lehmann, A. Pnueli, and J. Stavi, "Impartiality, justice and fairness: The ethic of concurrent systems", in Automata, Languages and Programming, S. Even and O. Kariv, Eds., LNCS 115, pp. 264-277, Springer-Verlag, 1981.
18. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Specification, Springer-Verlag, 1992.
19. Z. Manna and A. Pnueli, "A temporal proof methodology for reactive systems", in Program Design Calculi, M. Broy, Ed., NATO ASI Series F 118, pp. 287-323, 1992.
20. S. Owicki and L. Lamport, "Proving liveness properties of concurrent programs", ACM Transactions on Programming Languages and Systems, vol. 4, no. 3, pp. 455-495, July 1982.
21. K. Raymond, "A tree-based algorithm for distributed mutual exclusion", ACM Transactions on Computer Systems, vol. 7, no. 1, pp. 61-77, Feb. 1989.
22. W. Reisig, "Petri net models of distributed algorithms", in Computer Science Today: Recent Trends and Developments, Jan van Leeuwen, Ed., LNCS 1000, pp. 441-454, Springer-Verlag, 1995.
23. R. Walter, H. Völzer, T. Vesper, W. Reisig, E. Kindler, J. Freiheit, and J. Desel, "Memorandum: Petrinetzmodelle zur Verifikation verteilter Algorithmen", Informatik- Bericht 67, Humboldt-Universität zu Berlin, July 1996.
24. M. Weber, R. Walter, H. Völzer, T. Vesper, W. Reisig, S. Peuker, E. Kindler, J. Freiheit, and J. Desel, "DAWN. Petrinetzmodelle zur Verifikation Verteilter Algorithmen", Informatik-Bericht 88, Humboldt-Universität zu Berlin, November 1997. (Revised and extended version of [23]).