Sciweavers

Share
FASE
2006
Springer

Regular Inference for State Machines with Parameters

12 years 1 months ago
Regular Inference for State Machines with Parameters
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to construct models of software and hardware systems, for use, e.g., in test case generation. We intend to adapt these techniques to construct state machine models of entities of communication protocols. The alphabet of such state machines can be very large, since a symbol typically consists of a protocol data unit type with a number of parameters, each of which can assume many values. In typical algorithms for regular inference, the number of needed input words grows with the size of the alphabet and the size of the minimal DFA accepting the language. We therefore modify such an algorithm (Angluin's algorithm) so that its complexity grows not with the size of the alphabet, but only with the size of a certain symbolic representation of the DFA. The main new idea is to infer, for each state, a partitioning of in...
Therese Berg, Bengt Jonsson, Harald Raffelt
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where FASE
Authors Therese Berg, Bengt Jonsson, Harald Raffelt
Comments (0)
books