default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaffaella Gentilini
Person information
- affiliation: Kaiserslautern University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Mrudula Balachander, Emmanuel Filiot
, Raffaella Gentilini:
Passive Learning of Regular Data Languages in Polynomial Time and Data. CONCUR 2024: 10:1-10:21- 2022
- [d1]Andrea Formisano, Raffaella Gentilini, Flavio Vella:
Dataset_ScalableEnergyGamesSolversOnGPUs. IEEE DataPort, 2022
- 2021
- [j8]Andrea Formisano, Raffaella Gentilini, Flavio Vella:
Scalable Energy Games Solvers on GPUs. IEEE Trans. Parallel Distributed Syst. 32(12): 2970-2982 (2021) - 2020
- [c22]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Adversarial Stackelberg Value in Quantitative Games. ICALP 2020: 127:1-127:18 - [i3]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Adversarial Stackelberg Value in Quantitative Games. CoRR abs/2004.12918 (2020)
2010 – 2019
- 2019
- [c21]Marc Demange, David Ellison, Raffaella Gentilini:
Online Firefighting on Grids. ICTCS 2019: 91-96 - [i2]Marc Demange, David Ellison, Raffaella Gentilini:
Online Firefighting on Grids. CoRR abs/1907.07450 (2019) - 2018
- [c20]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Rational Synthesis Under Imperfect Information. LICS 2018: 422-431 - 2017
- [c19]Andrea Formisano, Raffaella Gentilini, Flavio Vella:
Accelerating Energy Games Solvers on Modern Architectures. IA3@SC 2017: 12:1-12:4 - [i1]Andrea Formisano, Raffaella Gentilini, Flavio Vella:
Accelerating Energy Games Solvers on Modern Architectures. CoRR abs/1710.03647 (2017) - 2016
- [c18]Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Complexity of Rational Synthesis. ICALP 2016: 121:1-121:15 - 2015
- [j7]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Quantitative Languages Defined by Functional Automata. Log. Methods Comput. Sci. 11(3) (2015) - [j6]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Rank and simulation: the well-founded case. J. Log. Comput. 25(6): 1331-1349 (2015) - 2014
- [j5]Raffaella Gentilini:
A note on the approximation of mean-payoff games. Inf. Process. Lett. 114(7): 382-386 (2014) - [c17]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Finite-Valued Weighted Automata. FSTTCS 2014: 133-145 - 2012
- [c16]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Rank-Based Simulation on Acyclic Graphs. CILC 2012: 149-160 - [c15]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Quantitative Languages Defined by Functional Automata. CONCUR 2012: 132-146 - 2011
- [j4]Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin:
Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38(2): 97-118 (2011) - [j3]Kerstin Bauer, Raffaella Gentilini, Klaus Schneider:
A uniform approach to three-valued semantics for μ-calculus on abstractions of hybrid automata. Int. J. Softw. Tools Technol. Transf. 13(3): 273-287 (2011) - [c14]Raffaella Gentilini:
A Note on the Approximation of Mean-Payoff Games. CILC 2011: 333-340 - 2010
- [c13]Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk:
Energy and Mean-Payoff Games with Imperfect Information. CSL 2010: 260-274
2000 – 2009
- 2009
- [c12]Kerstin Bauer, Raffaella Gentilini, Klaus Schneider:
Property Driven Three-Valued Model Checking on Hybrid Automata. WoLLIC 2009: 218-229 - 2008
- [j2]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Symbolic Graphs: Linear Solutions to Connectivity Related Problems. Algorithmica 50(1): 120-158 (2008) - [c11]Kerstin Bauer, Raffaella Gentilini, Klaus Schneider:
A Uniform Approach to Three-Valued Semantics for µ-Calculus on Abstractions of Hybrid Automata. Haifa Verification Conference 2008: 38-52 - [c10]Kerstin Bauer, Raffaella Gentilini, Klaus Schneider:
Approximated Reachability on Hybrid Automata: Falsification meets Certification. RP 2008: 47-60 - 2007
- [c9]Raffaella Gentilini, Klaus Schneider, Alexander Dreyer:
Three-valued automated reasoning on analog properties. ACM Great Lakes Symposium on VLSI 2007: 485-488 - [c8]Raffaella Gentilini, Klaus Schneider, Bud Mishra:
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking. LFCS 2007: 224-240 - [c7]Raffaella Gentilini, Klaus Schneider, Alexander Dreyer:
Combining Interval Arithmetic and Three-Valued Temporal Logics for the Verification of Analog Systems. MBMV 2007: 121-130 - 2005
- [b1]Raffaella Gentilini:
Graph algorithms for massive data-sets. University of Udine, Italy, 2005 - [c6]Raffaella Gentilini:
Reachability Problems on Extended O-Minimal Hybrid Automata. FORMATS 2005: 162-176 - 2003
- [j1]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
From Bisimulation to Simulation: Coarsest Partition Problems. J. Autom. Reason. 31(1): 73-103 (2003) - [c5]Raffaella Gentilini, Alberto Policriti:
Biconnectivity on Symbolically Represented Graphs: A Linear Solution. ISAAC 2003: 554-564 - [c4]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Computing strongly connected components in a linear number of symbolic steps. SODA 2003: 573-582 - 2002
- [c3]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Simulation as Coarsest Partition Problem. TACAS 2002: 415-430 - [c2]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Simulation Reduction as Constraint. WFLP 2002: 145-161 - [c1]Agostino Dovier, Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Rank-Based Symbolic Bisimulation (and Model Checking). WoLLIC 2002: 166-183
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
