Raffaella Gentilini

Orcid: 0000-0002-4400-3137

Affiliations:
  • Kaiserslautern University of Technology, Germany


According to our database1, Raffaella Gentilini authored at least 31 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Passive Learning of Regular Data Languages in Polynomial Time and Data.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

2022
Dataset_ScalableEnergyGamesSolversOnGPUs.
Dataset, May, 2022

2021
Scalable Energy Games Solvers on GPUs.
IEEE Trans. Parallel Distributed Syst., 2021

2020
The Adversarial Stackelberg Value in Quantitative Games.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Online Firefighting on Grids.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2018
Rational Synthesis Under Imperfect Information.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Accelerating Energy Games Solvers on Modern Architectures.
Proceedings of the Seventh Workshop on Irregular Applications: Architectures and Algorithms, 2017

2016
The Complexity of Rational Synthesis.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Rank and simulation: the well-founded case.
J. Log. Comput., 2015

Quantitative Languages Defined by Functional Automata
Log. Methods Comput. Sci., 2015

2014
A note on the approximation of mean-payoff games.
Inf. Process. Lett., 2014

Finite-Valued Weighted Automata.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2012
Rank-Based Simulation on Acyclic Graphs.
Proceedings of the 9th Italian Convention on Computational Logic, 2012

2011
A uniform approach to three-valued semantics for <i>μ</i>-calculus on abstractions of hybrid automata.
Int. J. Softw. Tools Technol. Transf., 2011

Faster algorithms for mean-payoff games.
Formal Methods Syst. Des., 2011

2010
Energy and Mean-Payoff Games with Imperfect Information.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
Property Driven Three-Valued Model Checking on Hybrid Automata.
Proceedings of the Logic, 2009

2008
Approximated Reachability on Hybrid Automata: Falsification meets Certification.
Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

Symbolic Graphs: Linear Solutions to Connectivity Related Problems.
Algorithmica, 2008

A Uniform Approach to Three-Valued Semantics for µ-Calculus on Abstractions of Hybrid Automata.
Proceedings of the Hardware and Software: Verification and Testing, 2008

2007
Combining Interval Arithmetic and Three-Valued Temporal Logics for the Verification of Analog Systems.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), 2007

Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Three-valued automated reasoning on analog properties.
Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, 2007

2005
Graph algorithms for massive data-sets.
PhD thesis, 2005

Reachability Problems on Extended O-Minimal Hybrid Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

2003
From Bisimulation to Simulation: Coarsest Partition Problems.
J. Autom. Reason., 2003

Computing strongly connected components in a linear number of symbolic steps.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Biconnectivity on Symbolically Represented Graphs: A Linear Solution.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Simulation Reduction as Constraint.
Proceedings of the 11th International Workshop on Functional and (Constraint) Logic Programming, 2002

Rank-Based Symbolic Bisimulation (and Model Checking).
Proceedings of the 9th Workhop on Logic, Language, Information and Computation, 2002

Simulation as Coarsest Partition Problem.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002


  Loading...