Reduced checking sequences using unreliable reset

Jourdan, Guy Vincent and Ural, Hasan and Yenigün, Hüsnü (2015) Reduced checking sequences using unreliable reset. Information Processing Letters, 115 (5). pp. 532-535. ISSN 0020-0190 (Print) 1872-6119 (Online)

Full text not available from this repository. (Request a copy)


The length of a checking sequence (CS) generated from a deterministic, minimal, and completely specified finite state machine model M of a system under test which does not have a reliable reset feature, is exponential when M does not have a distinguishing sequence. This is due to the exponential length locating sequences that need to be used in such a CS. In this work, we propose a method to decrease the number of locating sequences used in CS, by first verifying the reset input r and then using r as a reliable reset. When such a reset input is not available, a synchronizing sequence can be used as a compound reset input, which makes the proposed method applicable to a wide range of systems.
Item Type: Article
Uncontrolled Keywords: Model-based testing; Finite State Machines; Checking sequences; Synchronizing sequences; Formal methods
Subjects: Q Science > QA Mathematics > QA076 Computer software
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Hüsnü Yenigün
Date Deposited: 23 Jul 2015 16:34
Last Modified: 02 Aug 2019 16:02

Actions (login required)

View Item
View Item