Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Faster algorithms for mean-payoff games

- L. Brim, J. Chaloupka, L. Doyen, R. Gentilini, J. F. Raskin
- Computer Science
- Formal Methods Syst. Des.
- 1 April 2011

In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with… Expand

From Bisimulation to Simulation: Coarsest Partition Problems

- R. Gentilini, C. Piazza, A. Policriti
- Mathematics, Computer Science
- Journal of Automated Reasoning
- 6 October 2003

The notions of bisimulation and simulation are used for graph reduction and are widely employed in many areas: modal logic, concurrency theory, set theory, formal verification, and so forth. In… Expand

Energy and Mean-Payoff Games with Imperfect Information

- Aldric Degorre, L. Doyen, R. Gentilini, Jean-François Raskin, Szymon Toruńczyk
- Computer Science
- CSL
- 23 August 2010

We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistinguishable states,… Expand

Quantitative Languages Defined by Functional Automata

- E. Filiot, R. Gentilini, Jean-François Raskin
- Computer Science, Mathematics
- Log. Methods Comput. Sci.
- 24 September 2011

A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the… Expand

Computing strongly connected components in a linear number of symbolic steps

- R. Gentilini, C. Piazza, A. Policriti
- Mathematics, Computer Science
- SODA '03
- 12 January 2003

We present an algorithm that computes in a linear number of symbolic steps (<i>O</i>(|<i>V</i>|)) the strongly connected components (sccs) of a graph <i>G</i> = ⟨<i>V, E</i>⟩ represented by an… Expand

The Complexity of Rational Synthesis

- Rodica Condurache, E. Filiot, R. Gentilini, Jean-François Raskin
- Computer Science
- ICALP
- 1 August 2016

We study the computational complexity of the cooperative and non-cooperative rational synthesis problems, as introduced by Kupferman, Vardi and co-authors. We provide tight results for most of the… Expand

Symbolic Graphs: Linear Solutions to Connectivity Related Problems

- R. Gentilini, C. Piazza, A. Policriti
- Mathematics, Computer Science
- Algorithmica
- 14 December 2007

Abstract
The importance of symbolic data structures such as Ordered Binary Decision Diagrams (OBDD) is rapidly growing in many areas of Computer Science where the large dimensions of the input models… Expand

Simulation as Coarsest Partition Problem

- R. Gentilini, C. Piazza, A. Policriti
- Mathematics, Computer Science
- TACAS
- 8 April 2002

The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to the problem of finding the maximal bisimulation on a given structure.… Expand

Rational Synthesis Under Imperfect Information

- E. Filiot, R. Gentilini, Jean-François Raskin
- Computer Science
- LICS
- 9 July 2018

In this paper, we study the rational synthesis problem for turn-based multiplayer non zero-sum games played on finite graphs for omega-regular objectives. Rationality is formalized by the concept of… Expand

Quantitative Languages Defined by Functional Automata

- E. Filiot, R. Gentilini, Jean-François Raskin
- Computer Science, Mathematics
- CONCUR
- 4 September 2012

A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the… Expand