Fail-awareness in timed asynchronous systems
Fail-awareness in timed asynchronous systems
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
A Highly Available Local Leader Election Service
IEEE Transactions on Software Engineering
Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms
IEEE Transactions on Software Engineering
Distributed Algorithms
DR: Divided Ring Leader Election Algorithm
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
| Hi-index | 0.00 |
The Timed Asynchronous System (TAS) model[3] has less stringent assumptions than the synchronous model but is still strong enough to serve as a foundation for the construction of dependable applications. In this paper, we verify the correctness of some basic distributed services in TAS. First, TAS is modelled and then some important properties of two basic services, FADS (Fail Aware Datagram Service) and HALL (Highly Available Local Leader Election Service), are formally verified. The PVS theorem prover is used for modelling and verification of the algorithms. During the process of verification, some of the assumptions in the model that were not explicitly noted in the literature came to light. In addition, due to the insight gained in the process of verification, the ability to extend the validity of some of the properties in the face of additional failures in the system became clear through appropriate modifications of these assumptions.