A conformance testing method for communication protocols modeled as concurrent DFSMs. Treatment of non-observable non-determinism

Abstract

According to the progress of high-speed networks, many communication protocols are specified as concurrent systems. Such systems can be modeled as concurrent deterministic FSMs (DFSMs). In those , protocols, a common input may be taken by some of concurrent DFSMs competitively. I n such a case, the global behaviour becomes non-deterministic in general. Conformance testing is typically a black-box testing, i.e. it is based on its specifcation. Formal methods for deriving conformance test cases are widely recognized as being capable of producing tests with high fault coverage. In this paper, we propose a conformance testing method based on GWp-method for a sub-class of non-observable non-deterministic FSMs (NFSMs). In this class, the global behaviour of many protocols modeled as concurrent DFSMs can be specified. The proposed method can be used not only for testing NFSMs directly but also for testing concurrent DFSMs whose global behaviour becomes non-observable non-deterministic.

Combining Model Refinement and Test Generation for Conformance Testing of the IEEE PHD Protocol Using Abstract State Machines

“…In the classical MBT approach, the model is abstract, still it should contain enough details in order to test all the desired aspects of the SUT (system under test). The designer should spend a good amount of time to validate the model before it can be used for test generation and conformance testing [5,11,17,20]. In case a conformance fault is found, the system (or sometimes the model) should be modified.…”