Inferring Finite State Machines Without Reset Using State Identification Sequences

Identifying the finite state control structure of a black box system from the traces observed in finite interaction is of great interest for many model-based activities, such as model-based testing or model-driven engineering. There are several inference methods, but all those methods assume that the system can be reset whenever necessary. In this paper, we address the issue of inferring a finite state machine FSM that cannot be reset; we propose a method, inspired by FSM-based testing generation methods. We assume classical testing hypotheses, namely that we are given a bound n on the number of states and a set W of characterizing sequences to distinguish states. To the best of our knowledge, this is the first model inference method that does not require resetting the system, and does not require an external oracle to decide on equivalence. The length of the test sequence is polynomial in n and the exponent depends on the cardinal |W| of the characterization set.

[1]  Adenilso da Silva Simão,et al.  Generation of Checking Sequences Using Identification Sets , 2013, ICFEM.

[2]  Roland Groz,et al.  Inferring Mealy Machines , 2009, FM.

[3]  James R. Larus,et al.  Mining specifications , 2002, POPL '02.

[4]  James C. Corbett,et al.  Bandera: extracting finite-state models from Java source code , 2000, ICSE.

[5]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[6]  Karl Meinke,et al.  CGE: A Sequential Learning Algorithm for Mealy Automata , 2010, ICGI.

[7]  Bernhard Steffen,et al.  Introduction to Active Automata Learning from a Practical Perspective , 2011, SFM.

[8]  Marius Minea,et al.  JMODEX: Model extraction for verifying security properties of web applications , 2014, 2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE).

[9]  Hasan Ural,et al.  Construction of checking sequences based on characterization sets , 1995, Comput. Commun..

[10]  M. P. Vasilevskii.  Failure diagnosis of automata , 1973 .

[11]  Hasan Ural,et al.  Reduced checking sequences using unreliable reset , 2015, Inf. Process. Lett..

[12]  Roland Groz,et al.  Angluin style finite state machine inference with non-optimal counterexamples , 2010, MIIT '10.

[13]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

[14]  Bengt Jonsson,et al.  Generating models of infinite-state communication protocols using regular inference with abstraction , 2015, Formal Methods Syst. Des..

[15]  Keqin Li,et al.  Inferring Approximated Models for Systems Engineering , 2014, 2014 IEEE 15th International Symposium on High-Assurance Systems Engineering.

[16]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[17]  Paola Inverardi,et al.  Automatic synthesis of behavior protocols for composable web-services , 2009, ESEC/FSE '09.

[18]  F. C. Hennine.  Fault detecting experiments for sequential circuits , 1964, SWCT 1964.