Learning Finite State Models of Observable Nondeterministic Systems in a Testing Context - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Learning Finite State Models of Observable Nondeterministic Systems in a Testing Context

Abstract

Learning models from test observations can be adapted to the case when the system provides nondeterministic answers. In this paper we propose an algorithm for inferring observable nondeterministic finite state machines (ONFSMs). The algorithm is based on Angluin L* algorithm for learning DFAs. We define rules for constructing and updating learning queries taking into account the properties of ONFSMs. Application examples, complexity analysis and an experimental evaluation of the proposed algorithm are provided.
No file

Dates and versions

hal-00953395 , version 1 (28-02-2014)

Identifiers

  • HAL Id : hal-00953395 , version 1

Cite

Khaled El-Fakih, Roland Groz, Muhammad Naeem Irfan, Muzammil Shahbaz. Learning Finite State Models of Observable Nondeterministic Systems in a Testing Context. 22nd IFIP International Conference on Testing Software and Systems, 2010, Natal, Brazil. pp.97-102. ⟨hal-00953395⟩
234 View
0 Download

Share

Gmail Facebook X LinkedIn More