Principles of concurrent and distributed programming
Principles of concurrent and distributed programming
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Verification of parameterized programs
Specification and validation methods
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Temporal Verification Diagrams
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
Monotonic Abstraction in Action
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
| Hi-index | 0.00 |
This paper presents the first formal verification of the Ricart-Agrawala algorithm RA81. for distributed mutual exclusion of an arbitrary number of nodes. It uses the Temporal Methodology of [MP95a]. We establish both the safety property of mutual exclusion and the liveness property of accessibility. To establish these properties for an arbitrary number of nodes, parameterized proof rules are used as presented in [MP95a] (for safety) and [MP94] (for liveness). A new and efficient notation is introduced to facilitate the presentation of liveness proofs by verification diagrams. The proofs were carried out using the Stanford Temporal Prover (STEP) [BBC+95], a software package that supports formal verification of temporal specifications of concurrent and reactive systems.