Skip to main content
Conference Proceedings

Correctness proofs of distributed algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 938 164-177
DOI: 10.1007/3-540-60042-6_12
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Reisig, W. (1995). Correctness proofs of distributed algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 938, pp. 164–177). Springer Verlag. https://doi.org/10.1007/3-540-60042-6_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free