12 citations · 39 across the 12 of their papers we have counts for
14 papers
An Based Algorithm for Active Learning of Minimal Separating Automata
Jasper Laumen, Leonne Snel, Frits Vaandrager
A DFA separates two disjoint languages and if it accepts every word in and rejects every word in . Algorithms for active learning of small separating DFAs ha…
Compositional Abstraction for Timed Systems with Broadcast Synchronization
Hanyue Chen, Miaomiao Zhang, Frits Vaandrager
Simulation-based compositional abstraction effectively mitigates state space explosion in model checking, particularly for timed systems. However, existing approaches do not suppor…
Active Learning of Mealy Machines with Timers
Véronique Bruyère, Bharat Garhewal, Guillermo A. Pérez +2
We present the first algorithm for query learning Mealy machines with timers in a black-box context. Our algorithm is an extension of the L# algorithm of Vaandrager et al. to a tim…
Automata with Timers
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet +1
In this work, we study properties of deterministic finite-state automata with timers, a subclass of timed automata proposed by Vaandrager et al. as a candidate for an efficiently l…
Action Codes
Frits Vaandrager, Thorsten Wißmann
We provide a new perspective on the problem how high-level state machine models with abstract actions can be related to low-level models in which these actions are refined by seque…
A New Approach for Active Automata Learning Based on Apartness
Frits Vaandrager, Bharat Garhewal, Jurriaan Rot +1
We present , a new and simple approach to active automata learning. Instead of focusing on equivalence of observations, like the algorithm and its descendants, $…
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…
Modelling Clock Synchronization in the Chess gMAC WSN Protocol
Mathijs Schuts, Feng Zhu, Faranak Heidarian +1
We present a detailled timed automata model of the clock synchronization algorithm that is currently being used in a wireless sensor network (WSN) that has been developed by the Du…
Adaptive Scheduling of Data Paths using Uppaal Tiga
Israa AlAttili, Fred Houben, Georgeta Igna +3
We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a printer. As…
A theory of normed simulations
W. O. D. Griffioen, F. W. Vaandrager
In existing simulation proof techniques, a single step in a lower-level specification may be simulated by an extended execution fragment in a higher-level one. As a result, it is c…