3 citations · 5 across the 3 of their papers we have counts for
5 papers
Grey-Box Learning of Register Automata
Bharat Garhewal, Frits Vaandrager, Falk Howar +3
Model learning (a.k.a. active automata learning) is a highly effective technique for obtaining black-box finite state models of software components. Thus far, generalisation to inf…
Relating Alternating Relations for Conformance and Refinement
Ramon Janssen, Frits Vaandrager, Jan Tretmans
Various relations have been defined to express refinement and conformance for state-transition systems with inputs and outputs, such as ioco and uioco in the area of model-based te…
State Identification for Labeled Transition Systems with Inputs and Outputs
Petra van den Bos, Frits Vaandrager
For Finite State Machines (FSMs) a rich testing theory has been developed to discover aspects of their behavior and ensure their correct functioning. Although this theory is widely…
Learning Unions of k-Testable Languages
Alexis Linard, Colin de la Higuera, Frits Vaandrager
A classical problem in grammatical inference is to identify a language from a set of examples. In this paper, we address the problem of identifying a union of languages from exampl…
Learning Pairwise Disjoint Simple Languages from Positive Examples
Alexis Linard, Rick Smetsers, Frits Vaandrager +3
A classical problem in grammatical inference is to identify a deterministic finite automaton (DFA) from a set of positive and negative examples. In this paper, we address the relat…