46 citations · 75 across the 6 of their papers we have counts for
6 papers
Non-Zero Sum Games for Reactive Synthesis
Romain Brenguier, Lorenzo Clemente, Paul Hunter +5
In this invited contribution, we summarize new solution concepts useful for the synthesis of reactive systems that we have introduced in several recent publications. These solution…
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…
The Complexity of Admissibility in Omega-Regular Games
Romain Brenguier, Jean-François Raskin, Mathieu Sassolas
Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwa…
Quantifying Opacity
B. Bérard, J. Mullins, M. Sassolas
Opacity is a general language-theoretic framework in which several security properties of a system can be expressed. Its parameters are a predicate, given as a subset of runs of th…
Interrupt Timed Automata: verification and expressiveness
Béatrice Bérard, Serge Haddad, Mathieu Sassolas
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single pr…