Raffaella Gentilini

	2011
17		Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin: Quantitative Languages Defined by Functional Automata CoRR abs/1111.0862: (2011)
16		Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin: Faster algorithms for mean-payoff games. Formal Methods in System Design 38(2): 97-118 (2011)
15		Kerstin Bauer, Raffaella Gentilini, Klaus Schneider: A uniform approach to three-valued semantics for μ-calculus on abstractions of hybrid automata. STTT 13(3): 273-287 (2011)
	2010
14		Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk: Energy and Mean-Payoff Games with Imperfect Information. CSL 2010: 260-274
	2009
13		Kerstin Bauer, Raffaella Gentilini, Klaus Schneider: Property Driven Three-Valued Model Checking on Hybrid Automata. WoLLIC 2009: 218-229
	2008
12		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
11		Raffaella Gentilini, Carla Piazza, Alberto Policriti: Symbolic Graphs: Linear Solutions to Connectivity Related Problems. Algorithmica 50(1): 120-158 (2008)
10		Kerstin Bauer, Raffaella Gentilini, Klaus Schneider: Approximated Reachability on Hybrid Automata: Falsification meets Certification. Electr. Notes Theor. Comput. Sci. 223: 47-60 (2008)
	2007
9		Raffaella Gentilini, Klaus Schneider, Alexander Dreyer: Three-valued automated reasoning on analog properties. ACM Great Lakes Symposium on VLSI 2007: 485-488
8		Raffaella Gentilini, Klaus Schneider, B. Mishra: Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking. LFCS 2007: 224-240
	2005
7		Raffaella Gentilini: Reachability Problems on Extended O-Minimal Hybrid Automata. FORMATS 2005: 162-176
	2003
6		Raffaella Gentilini, Alberto Policriti: Biconnectivity on Symbolically Represented Graphs: A Linear Solution. ISAAC 2003: 554-564
5		Raffaella Gentilini, Carla Piazza, Alberto Policriti: Computing strongly connected components in a linear number of symbolic steps. SODA 2003: 573-582
4		Raffaella Gentilini, Carla Piazza, Alberto Policriti: From Bisimulation to Simulation: Coarsest Partition Problems. J. Autom. Reasoning 31(1): 73-103 (2003)
	2002
3		Raffaella Gentilini, Carla Piazza, Alberto Policriti: Simulation as Coarsest Partition Problem. TACAS 2002: 415-430
2		Agostino Dovier, Raffaella Gentilini, Carla Piazza, Alberto Policriti: Rank-Based Symbolic Bisimulation (and Model Checking). Electr. Notes Theor. Comput. Sci. 67: 166-183 (2002)
1		Raffaella Gentilini, Carla Piazza, Alberto Policriti: Simulation Reduction as Constraint. Electr. Notes Theor. Comput. Sci. 76: 145-161 (2002)

Coauthor Index

1	Kerstin Bauer	[10] [12] [13] [15]
2	Lubos Brim	[16]
3	Jakub Chaloupka	[16]
4	Aldric Degorre	[14]
5	Agostino Dovier	[2]
6	Laurent Doyen	[14] [16]
7	Alexander Dreyer	[9]
8	Emmanuel Filiot	[17]
9	B. Mishra	[8]
10	Carla Piazza	[1] [2] [3] [4] [5] [11]
11	Alberto Policriti	[1] [2] [3] [4] [5] [6] [11]
12	Jean-François Raskin	[14] [16] [17]
13	Klaus Schneider	[8] [9] [10] [12] [13] [15]
14	Szymon Torunczyk	[14]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page