Validating Protocol Composition for Progress by Parallel Step Reachability Analysis
Gurdip Singh, Hong Liu · 1997
In this paper, we propose a parallel step exploration technique for protocol validation in the context of protocol composition. A protocol is modeled as a network of extended communicating finite state machines (ECFSM’s). A composite protocol is defined as an interleaved execution of a set of component protocols subject to a set of constraints such as synchronization , ordering and inhibition . By encoding the constraints into the component protocols and the analysis algorithm, our method keeps each process in the component protocols as a separate entity and performs validation without constructing the composite protocol explicitly. We show that our technique not only achieves significant state reduction but also preserves the progress property of the composite protocol in the reduced state space. To our best knowledge, this is the first attempt to adapt existing state reduction techniques to the validation of protocol composition. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.