| Holtzmann, G. 1991. Design and Validation of Computer Protocols. Prentice-Hall. |
....been used for the specification phase. One of most common models used is the Finite State Machine (FSM) Kohavi 1978] It models a system through an input output function that is evaluated by a finite automaton. Starting from basic FSMs, several extensions have been proposed. Extended FSMs (EFSM) [Holtzmann 1991], for example, introduce the concept of non destructive communication; that is, the written information can be read by the receiver several times. In Behavioural FSMs (BFSM) Takach and Wolf 1995] inputs and outputs are partially sorted according to time, so time constraints can be expressed. ....
Holtzmann, G. 1991. Design and Validation of Computer Protocols. Prentice-Hall.
....properties are for each combination of failure conditions, there is an FDIR response specified and for each combination of failure conditions there is at most one FDIR response specified. Dynamic properties of the model were tested by translating the SCR state machine model into PROMELA [23], and applying the SPIN model checker to explore its behavior. For example, some of the requirements express conditions to test whether various recovery actions have already been tried. These conditions were validated by exploring the dynamic behavior of the model in the face of multiple failures, ....
G.J. Holtzmann, Design and Validation of Computer Protocols. Prentice Hall, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC