Skip to Main Content
Distributed system protocol verification has the intrinsic problem of mechanizability of intricate reasoning pattern and/or state-space explosion. The former arises in case of theorem proving approach due to the ingenuity involved in constructing a proof and the latter is encountered in model checking approach while carrying out composition of a large number of processes that constitute a typical distributed system. In the present paper, the authors have improvised a technique combining the tableau based theorem proving approach and model checking. The process has been illustrated using the example of Leader Election Protocol in synchronous rings.