Name
Abstract | ||
|---|---|---|
The paper presents a method for deriving a complete test suite for a timed deterministic FSM with time-outs when only the upper bound on the number of states and the largest finite time-out at a state of an implementation under test are known. We also show that a test suite derived for a corresponding classical FSM is much longer than this obtained directly from a FSM with time-outs. The application to a case study, the Loan Approval Service, illustrates how our approach can be applied for deriving tests for compositions of timed FSMs. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/QSIC.2011.30 | Quality Software |
Keywords | Field | DocType |
deterministic automata,finite state machines,FSM-based test derivation strategy,finite time-out,loan approval service,timed deterministic FSM,FSM with time-outs (timed FSM),complete test suite,the functional equivalence | Test suite,Computer science,Upper and lower bounds,Implementation under test,Algorithm,Finite-state machine,Real-time computing | Conference |
ISSN | ISBN | Citations |
1550-6002 E-ISBN : 978-0-7695-4468-7 | 978-0-7695-4468-7 | 9 |
PageRank | References | Authors |
0.86 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhigulin, M. | 1 | 9 | 0.86 |
| Yevtushenko, N. | 2 | 9 | 0.86 |
| Maag, S. | 3 | 9 | 0.86 |
| Cavalli, A. | 4 | 14 | 1.62 |