Loading...
Please wait, while we are loading the content...
Similar Documents
Page 1 TEST SELECTION BASED ON COMMUNICATING NONDETERMINISTIC FINITE STATE MACHINES USING A GENERALIZED Wp-METHOD 1
| Content Provider | CiteSeerX |
|---|---|
| Author | Luo, Gang Bochmann, Gregor V. Petrenko, Re |
| Abstract | ABSTRACT We present a method of generating test sequences for concurrent programs and communication protocols that are modeled as communicating nondeterministic finite state machines (CNFSMs). A conformance relation, called trace-equivalence, is defined within this model, serving as a guide to test generation. A test generation method for a single nondeterministic finite state machine (NFSM) is developed, which is an improved and generalized version of the Wp-method that generates test sequences only for deterministic finite state machines. It is applicable to both nondeterministic and deterministic finite state machines. When applied to deterministic finite state machines, it yields usually smaller test suites with full fault coverage than the existing methods that also provide full fault coverage, when the numbers of states in implementation NFSMs are bounded by a known integer. For a system of CNFSMs, the test sequences are generated in the following manner: A system of CNFSMs is first reduced into a single NFSM by reachability analysis; then the test sequences are generated from the resulting NFSM using the generalized Wp-method. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Test Sequence Deterministic Finite State Machine Full Fault Coverage Implementation Nfsms Conformance Relation Nondeterministic Finite State Machine Test Suite Test Generation Method Known Integer Reachability Analysis Concurrent Program Communication Protocol Single Nfsm Single Nondeterministic Finite State Machine Following Manner Generalized Wp-method Generalized Version |
| Content Type | Text |
