46 citations · 72 across the 9 of their papers we have counts for
10 papers
A Zielonka-type Construction for Connectedly Communicating Processes
Béatrice Bérard, Benjamin Monmege, B Srivathsan +1
Given a global specification as a trace-closed regular language, Zielonka's theorem provides a construction to synthesise a language equivalent distributed implementation represent…
Synthesising Asynchronous Automata from Fair Specifications
Béatrice Bérard, Benjamin Monmege, B Srivathsan +1
Asynchronous automata are a model of distributed finite state processes synchronising on shared actions. A celebrated result by Zielonka shows how a deterministic asynchronous auto…
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…
Probabilistic Opacity in Refinement-Based Modeling
Béatrice Bérard, Olga Kouchnarenko, John Mullins +1
Given a probabilistic transition system (PTS) partially observed by an attacker, and an -regular predicate over the traces of , measuring the disclosure of t…
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…
Interrupt Timed Automata with Auxiliary Clocks and Parameters
Béatrice Bérard, Serge Haddad, Aleksandra Jovanović +1
Interrupt Timed Automata (ITA) is an expressive timed model, introduced to take into account interruptions, according to levels. Due to this feature, this formalism is incomparable…