5 citations · 9 across the 4 of their papers we have counts for
4 papers · 1 filter
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise
Igor Khmelnitsky, Serge Haddad, Lina Ye +5
Angluin's L* algorithm learns the minimal (complete) deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approxim…
Synthesis in Presence of Dynamic Links
Béatrice Bérard, Benedikt Bollig, Patricia Bouyer +2
The problem of distributed synthesis is to automatically generate a distributed algorithm, given a target communication network and a specification of the algorithm's correct behav…
Identifiers in Registers - Describing Network Algorithms with Logic
Benedikt Bollig, Patricia Bouyer, Fabian Reiter
We propose a formal model of distributed computing based on register automata that captures a broad class of synchronous network algorithms. The local memory of each process is rep…
Gossiping in Message-Passing Systems
Benedikt Bollig, Marie Fortin, Paul Gastin
We study the gossip problem in a message-passing environment: When a process receives a message, it has to decide whether the sender has more recent information on other processes…