Checking Experiments for Finite State Machines with Symbolic Inputs

Alexandre Petrenko (1) , Adenilso Simao (2)

1 CRIM - Centre de Recherche Informatique de Montréal = Computer Research Institute of Montréal
2 USP - Universidade de São Paulo = University of São Paulo

There exists a significant body of work in the theory of checking experiments devoted to test generation from FSM which guarantees complete fault coverage for a given fault model. Practical applications require nevertheless methods for fault-model driven test generation from Extended FSMs (EFSM). Traditional approaches for EFSM focus on model coverage, which provides no characterization of faults that can be detected by the generated tests. Only few approaches use fault models, and we are not aware of any result in the theory of checking experiments for extended FSMs. In this paper, we lift the theory of checking experiments to EFSMs, which are Mealy machines with predicates defined over input variables treated as symbolic inputs. Considering this kind of EFSM, we propose a test generation method that produces a symbolic checking experiment, adapting the well-known HSI method. We then present conditions under which arbitrary instances of a symbolic checking experiment can be used for testing black-box implementations, while guaranteeing complete fault coverage.

Mots clés: Finite state machines; Extended finite state machines; Symbolic automata; Conformance testing; Checking experiments; Fault model based test generation

Domaines: Informatique [cs]; Réseaux et télécommunications [cs.NI]

Alexandre Petrenko, Adenilso Simao. Checking Experiments for Finite State Machines with Symbolic Inputs. 27th IFIP International Conference on Testing Software and Systems (ICTSS), Nov 2015, Sharjah and Dubai, United Arab Emirates. pp.3-18, ⟨10.1007/978-3-319-25945-1_1⟩. ⟨hal-01470154⟩