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
9 papers · 2 filters
Average-energy games (full version)
Patricia Bouyer, Nicolas Markey, Mickael Randour +2
Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment.…
The height of piecewise-testable languages and the complexity of the logic of subwords
Prateek Karandikar, Philippe Schnoebelen
The height of a piecewise-testable language is the maximum length of the words needed to define by excluding and requiring given subwords. The height of is an important…
ATLsc with partial observation
François Laroussinie, Nicolas Markey, Arnaud Sangnier
Alternating-time temporal logic with strategy contexts (ATLsc) is a powerful formalism for expressing properties of multi-agent systems: it extends CTL with strategy quantifiers, o…
Average-energy games
Patricia Bouyer, Nicolas Markey, Mickael Randour +2
Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment.…
Unfolding-Based Process Discovery
Hernán Ponce-de-León, César Rodríguez, Josep Carmona +2
This paper presents a novel technique for process discovery. In contrast to the current trend, which only considers an event log for discovering a process model, we assume two addi…
Deciding definability in FO2(<h,<v) on trees
Thomas Place, Luc Segoufin
We provide a decidable characterization of regular forest languages definable in FO2(<h,<v). By FO2(<h,<v) we refer to the two variable fragment of first order logic built from the…