Concurrency theory will set standards for description and analysis of software
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
State space generation for the HAVi leader election protocol
Science of Computer Programming
Analysis of an Industrial System
Formal Methods in System Design
Proof-Checking Protocols Using Bisimulations
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
| Hi-index | 0.00 |
In this note we present an algebraic verification of Segall''s Propagation of Information with Feedback (PIF) algorithm. This algorithm serves as a nice benchmark for verification exercises (see [2, 13, 8]). The verification is based on the methodology presented in [7] and demonstrates its applicability to distributed algorithms.