3 citations · 3 across the 1 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2020
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…
cs.FL2015★ 3 cited
Polynomial Interrupt Timed Automata
Béatrice Bérard, Serge Haddad, Claudine Picaronny +2
Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They…