Abstract: Appropriated frameworks are unpredictable, being typically made out of a few subsystems running in parallel. Simultaneous execution and between procedure correspondence in these frameworks are inclined to lapses that are hard to recognize by customary testing, which does not cover each conceivable system execution. Not at all like testing, model checking can distinguish such blames in a simultaneous framework by investigating each conceivable condition of the framework. In any case, most model-checking strategies oblige that a framework be portrayed in a modeling dialect. In spite of the fact that this improves check, shortcomings may be presented in the execution. As of late, some model checkers check system code at runtime yet have a tendency to be constrained to remain solitary projects. This paper proposes cache based model checking for peer to peer systems, which unwinds the restriction to some degree by checking one procedure at once and running different procedures in another execution environment. This methodology has been executed as an augmentation of Java PathFinder, a Java model checker. It is a versatile and promising procedure to handle conveyed frameworks. To bolster a bigger class of circulated frameworks, a check pointing apparatus is additionally coordinated into the check framework. Test results on different conveyed frameworks demonstrate the ability and adaptability of store based model checking.
Keywords: Model checker, I/O Cache, Peer process.