A Model-checking Algorithm for Formal-verification of Peer-to-peer Fault-tolerant Networks

Abstract

 Abstract— In this paper, the goal is to perform the verification of fault-tolerant properties of a peer-to-peer (P2P) network consisting of n nodes running n corresponding parallel processes. The specification of the processes is in the form of communicating finite state machines (CFSMs). The work to be reported in this paper follows the prequel work wherein, instead of the traditional approach to construct a single synchronous product machine by composing the given CFSMs, we simulate each of the CFSMs in the non-local environment of other CFSMs and generate a set of what are called Communicating Minimal Prefix Machines(CMPMs). In this paper, we take the CMPMs model and perform the reachability analysis of certain global state vectors without losing the locality of the CFSMs of the given specification. This method cuts down the state space explosion and also opens out the possibility of distributed exploration of the local CFSM states. Faulttolerance consists of both safety and liveness properties and our approach provides a sound platform for performing state exploration/model-checking to verify these properties of the given set of application tasks that run in the P2P network. Index Terms—CFSMs-to-CMPMs model, liveness, modelchecking, P2P networks, safety, state-space explosion.