| 2008 |
|---|
| 12 | EE | 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 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Symbolic Graphs: Linear Solutions to Connectivity Related Problems.
Algorithmica 50(1): 120-158 (2008) |
| 10 | EE | 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 | EE | Raffaella Gentilini,
Klaus Schneider,
Alexander Dreyer:
Three-valued automated reasoning on analog properties.
ACM Great Lakes Symposium on VLSI 2007: 485-488 |
| 8 | EE | Raffaella Gentilini,
Klaus Schneider,
B. Mishra:
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking.
LFCS 2007: 224-240 |
| 2005 |
|---|
| 7 | EE | Raffaella Gentilini:
Reachability Problems on Extended O-Minimal Hybrid Automata.
FORMATS 2005: 162-176 |
| 2003 |
|---|
| 6 | EE | Raffaella Gentilini,
Alberto Policriti:
Biconnectivity on Symbolically Represented Graphs: A Linear Solution.
ISAAC 2003: 554-564 |
| 5 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Computing strongly connected components in a linear number of symbolic steps.
SODA 2003: 573-582 |
| 4 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
From Bisimulation to Simulation: Coarsest Partition Problems.
J. Autom. Reasoning 31(1): 73-103 (2003) |
| 2002 |
|---|
| 3 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Simulation as Coarsest Partition Problem.
TACAS 2002: 415-430 |
| 2 | EE | Agostino Dovier,
Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Rank-Based Symbolic Bisimulation (and Model Checking).
Electr. Notes Theor. Comput. Sci. 67: (2002) |
| 1 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Simulation Reduction as Constraint.
Electr. Notes Theor. Comput. Sci. 76: (2002) |
