Name
Abstract | ||
|---|---|---|
Abstract--In this paper, we investigate the problem of configuration verification for the extended FSM (EFSM) model. This is an extension of the FSM state identification problem. Specifically, given a configuration (驴state vector驴) and an arbitrary set of configurations, determine an input sequence such that the EFSM in the given configuration produces an output sequence different from that of the configurations in the given set or at least in a maximal proper subset. Such a sequence can be used in a test case to confirm the destination configuration of a particular EFSM transition. We demonstrate that this problem could be reduced to the EFSM traversal problem, so that the existing methods and tools developed in the context of model checking become applicable. We introduce notions of EFSM projections and products and, based on these notions, we develop a theoretical framework for determining configuration-confirming sequences. The proposed approach is illustrated on a realistic example. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TSE.2004.1265734 | Software Engineering, IEEE Transactions |
Keywords | Field | DocType |
conformance testing,finite state machines,formal verification,program testing,specification languages,EFSM traversal problem,FSM state identification,configuration verification,configuration-confirming sequence,conformance testing,extended FSM model,finite state machine,formal method,functional testing,model based testing,model checking | State vector,Tree traversal,Model checking,Computer science,Algorithm,Extended finite-state machine,Finite-state machine,Theoretical computer science,Model-based testing,Parameter identification problem,Formal verification | Journal |
Volume | Issue | ISSN |
30 | 1 | 0098-5589 |
Citations | PageRank | References |
87 | 3.02 | 44 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandre Petrenko | 1 | 176 | 15.90 |
| Sergiy Boroday | 2 | 294 | 14.03 |
| Roland Groz | 3 | 496 | 50.60 |