Raffaella Gentilini

36 papers A* 4A 1B 5C 2Misc 1Journal 11Unranked 11
YearRankTypeTitle / Venue / Authors
2025 B conf
Register Automata with Permutations.
MFCS
Mrudula Balachander, Emmanuel Filiot, Raffaella Gentilini, Nikos Tzevelekos
2024 B conf
Passive Learning of Regular Data Languages in Polynomial Time and Data.
CONCUR
Mrudula Balachander, Emmanuel Filiot, Raffaella Gentilini
2021 J jnl
Scalable Energy Games Solvers on GPUs.
IEEE Trans. Parallel Distributed Syst.
Andrea Formisano, Raffaella Gentilini, Flavio Vella
2020 A* conf
The Adversarial Stackelberg Value in Quantitative Games.
ICALP
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2020 J jnl
The Adversarial Stackelberg Value in Quantitative Games.
CoRR
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2019 — conf
Online Firefighting on Grids.
ICTCS
Marc Demange, David Ellison, Raffaella Gentilini
2019 J jnl
Online Firefighting on Grids.
CoRR
Marc Demange, David Ellison, Raffaella Gentilini
2018 A* conf
Rational Synthesis Under Imperfect Information.
LICS
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2017 — conf
Accelerating Energy Games Solvers on Modern Architectures.
IA3@SC
Andrea Formisano, Raffaella Gentilini, Flavio Vella
2017 J jnl
Accelerating Energy Games Solvers on Modern Architectures.
CoRR
Andrea Formisano, Raffaella Gentilini, Flavio Vella
2016 A* conf
The Complexity of Rational Synthesis.
ICALP
Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2015 J jnl
Quantitative Languages Defined by Functional Automata
Log. Methods Comput. Sci.
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2015 J jnl
Rank and simulation: the well-founded case.
J. Log. Comput.
Raffaella Gentilini, Carla Piazza, Alberto Policriti
2014 J jnl
A note on the approximation of mean-payoff games.
Inf. Process. Lett.
Raffaella Gentilini
2014 — conf
Finite-Valued Weighted Automata.
FSTTCS
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2012 B conf
Quantitative Languages Defined by Functional Automata.
CONCUR
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2012 — conf
Rank-Based Simulation on Acyclic Graphs.
CILC
Raffaella Gentilini, Carla Piazza, Alberto Policriti
2011 — conf
A Note on the Approximation of Mean-Payoff Games.
CILC
Raffaella Gentilini
2011 J jnl
A uniform approach to three-valued semantics for
Int. J. Softw. Tools Technol. Transf.
Kerstin Bauer, Raffaella Gentilini, Klaus Schneider
2011 J jnl
Faster algorithms for mean-payoff games.
Formal Methods Syst. Des.
Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin
2010 B conf
Energy and Mean-Payoff Games with Imperfect Information.
CSL
Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk
2009 C conf
Property Driven Three-Valued Model Checking on Hybrid Automata.
WoLLIC
Kerstin Bauer, Raffaella Gentilini, Klaus Schneider
2008 — conf
A Uniform Approach to Three-Valued Semantics for µ-Calculus on Abstractions of Hybrid Automata.
Haifa Verification Conference
Kerstin Bauer, Raffaella Gentilini, Klaus Schneider
2008 — conf
Approximated Reachability on Hybrid Automata: Falsification meets Certification.
RP
Kerstin Bauer, Raffaella Gentilini, Klaus Schneider
2008 J jnl
Symbolic Graphs: Linear Solutions to Connectivity Related Problems.
Algorithmica
Raffaella Gentilini, Carla Piazza, Alberto Policriti
2007 — conf
Combining Interval Arithmetic and Three-Valued Temporal Logics for the Verification of Analog Systems.
MBMV
Raffaella Gentilini, Klaus Schneider, Alexander Dreyer
2007 Misc conf
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking.
LFCS
Raffaella Gentilini, Klaus Schneider, Bud Mishra
2007 — conf
Three-valued automated reasoning on analog properties.
ACM Great Lakes Symposium on VLSI
Raffaella Gentilini, Klaus Schneider, Alexander Dreyer
2005 — —
Graph algorithms for massive data-sets.
Raffaella Gentilini
2005 — conf
Reachability Problems on Extended O-Minimal Hybrid Automata.
FORMATS
Raffaella Gentilini
2003 B conf
Biconnectivity on Symbolically Represented Graphs: A Linear Solution.
ISAAC
Raffaella Gentilini, Alberto Policriti
2003 A* conf
Computing strongly connected components in a linear number of symbolic steps.
SODA
Raffaella Gentilini, Carla Piazza, Alberto Policriti
2003 J jnl
From Bisimulation to Simulation: Coarsest Partition Problems.
J. Autom. Reason.
Raffaella Gentilini, Carla Piazza, Alberto Policriti
2002 C conf
Rank-Based Symbolic Bisimulation (and Model Checking).
WoLLIC
Agostino Dovier, Raffaella Gentilini, Carla Piazza, Alberto Policriti
2002 — conf
Simulation Reduction as Constraint.
WFLP
Raffaella Gentilini, Carla Piazza, Alberto Policriti
2002 A conf
Simulation as Coarsest Partition Problem.
TACAS
Raffaella Gentilini, Carla Piazza, Alberto Policriti