Protocol Verification Using Finite State Machine Model:-
The finite state machine is a mainly used in several protocol models with this technique, every protocol machine is always in a particular state at every time instant. Variables, including the program counter.
From every state, there are zero or more possible transition to other states. When some event happens, transition take place. In case of a protocol machine, a transition might take place if a frame is transmitted, if a frame arrives, if a timer expires, if an interrupt takes place, etc.
One particular state is designated as the initial state. This state corresponds to the description of the system when it starts running, or at some convenient starting place shortly thereafter. From the initial state, some, perhaps all, of the other states may be approached by a sequence of transition. this technique is called reachability analysis. This analysis can be helpful in determining whether a protocol is correct.
All processes are in their initial states at the starting of time. Then events start to happen, like frames becoming available for transmission or timers going off. To take an action and switch to a new state each event can cause one of the processes or the channel. One can construct the reachability graph and analyze the protocol, by carefully enumerating every possible successor to each state.
If you want to learn in detail so please click this link 😃😃
https://drive.google.com/file/d/1uRrR5K93IQEeLtS0lo4IQa7W-rYf4BBZ/view?usp=drivesdk
Comments
Post a Comment