A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
The level of handshake required for managing a connection
Distributed Computing
On the refinement of liveness properties of distributed systems
Formal Methods in System Design
| Hi-index | 0.00 |
During the past few years, the technology for formal specification and verification of communication protocols has matured to the point where we believe that it now provides practical assistance for protocol design and validation. Several models for distributed systems in general and communication protocols in particular have been developed, and recent advances include formal models that allow reasoning about untimed systems as well as timed systems, e. g.,[AL92a, GSSL93, LV93a, LV93b]. In connection with these models a host of proof techniques have been developed for proving that one protocol implements another. One class of proof techniques is the simulation techniques (including refinement mappings, and forward and simulations) [AL91, GSSL93, Jon91, LV92, LV93a, LV93b]. In this work, we show how one approach to formal specification and verification of distributed systems - the live (timed) I/O automata of [GSSL93] - can be used to verify an important class of communication protocols-those for reliable at-most-once message delivery. Thus, the report has two main parts: first, the formal framework of [GSSL93] is presented and augmented with additional theory (including a new temporal logic). Second, we consider the verification example. The purpose of our work is to provide better understanding, documentation and proof for the reliable at-most-once message delivery protocols, and to test the adequacy of the formal framework.