Concurrent system and its significance to web based system
Dakshinamurthy Sungeetha, K. Narayanan Vasumathi · 2016
In this article, we propose a Communicating Finite state machines consisting of co-operative system specification that communicate by binary, rendezvous interactions. Our verification approach unfolds the state machines in consistent to synchronization to generate CMPM (Communicating Minimal Prefix Machine). In this proposal, distributed set of concurrent kripke tree structure is shown by using the unfolded Communicating Minimal Prefix Machines. The component Kripke structures follows their corresponding local identities and a global analysis concurring throughout the environment vectors to annotate each local Communicating Minimal Prefix Machine state of the component Kripke structure. Using the unfolded state transition diagrams, the manner of synthesizing an approximate global time and verifying the safety, liveness and fairness properties of the system have been shown. Thus, we accomplish extensible as well as reduction of state-explosion in our model-checking is performed utilizing distributed branching time logic. Web-frame work is discussed.