88 citations
- École Normale Supérieure Paris-SaclayFR90 papers
- Centre National de la Recherche ScientifiqueFR87 papers
- Institut national de recherche en sciences et technologies du numériqueFR29 papers
- Université Paris-SaclayFR16 papers
- Chennai Mathematical InstituteIN10 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR9 papers
- Institute of Science and Technology AustriaAT8 papers
- Université Libre de BruxellesBE7 papers
- Aalborg UniversityDK6 papers
- Université Paris CitéFR6 papers
- University of MonsBE6 papers
- Centre Inria de l'Université de RennesFR5 papers
4 papers · 2 filters
Synthesis of Switching Rules for Ensuring Reachability Properties of Sampled Linear Systems
Laurent Fribourg, Bertrand Revol, Romain Soulat
We consider here systems with piecewise linear dynamics that are periodically sampled with a given period τ . At each sampling time, the mode of the system, i.e., the parameters of…
Generalized Post Embedding Problems
Prateek Karandikar, Philippe Schnoebelen
The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining dire…
First-order query evaluation on structures of bounded degree
Wojciech Kazana, Luc Segoufin
We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration probl…
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
Patricia Bouyer, Nicolas Markey, Jörg Olschewski +1
We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the…