Embedded Systems Group

Publications: Search Result

2009

BibTeX Search WWW PDF   [BaGS09a]
K. Bauer and R. Gentilini and K. Schneider
Property Driven Three Valued Model Checking on Hybrid Automata
Workshop on Logic, Language, Information and Computation (WoLLIC)
BibTeX Search WWW PDF   [BaGS09b]
K. Bauer and R. Gentilini and K. Schneider
A Uniform Approach to Three-Valued Semantics for µ-Calculus on Abstractions of Hybrid Automata
International Haifa Verification Conference (HVC)

2008

BibTeX Search WWW PDF   [BaGS08]
K. Bauer and R. Gentilini and K. Schneider
Approximated Reachability on Hybrid Automata: Falsification meets Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
BibTeX Search WWW PDF   [GePP08]
R. Gentilini and C. Piazza and A. Policriti
Symbolic Graphs: Linear Solutions to Some Connectivity Problems
Algorithmica

2007

BibTeX Search WWW PDF   [GeSD07a]
R. Gentilini and K. Schneider and A. Dreyer
Combining Interval Arithmetic and Three-Valued Temporal Logics for the Verification of Analog Systems
Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV)
BibTeX Search WWW PDF   [GeSD07b]
R. Gentilini and K. Schneider and A. Dreyer
Three-Valued Automated Reasoning on Analog Properties
Great Lakes Symposium on VLSI (GLSVLSI)
BibTeX Search WWW PDF   [GeSM07]
R. Gentilini and K. Schneider and B. Mishra
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
International Symposium on Logical Foundations of Computer Science (LFCS)

2005

BibTeX Search WWW PDF   [Gent05]
R. Gentilini
Reachability Problems on Extended O-Minimal Hybrid Automata
Formal Modeling and Analysis of Timed Systems (FORMATS)
BibTeX Search WWW PDF   [Gent05a]
R. Gentilini
Toward Integration of Systems Biology Formalism: The Gene Regulatory Networks Case
Genome Informatics

2004

BibTeX Search WWW PDF   [Gent04]
R. Gentilini
Graph Algorithms for Massive Data-Sets
PhD Thesis

2003

BibTeX Search WWW PDF   [GePP03]
R. Gentilini and C. Piazza and A. Policriti
Computing Strongly Connected Components in a Linear Number of Symbolic Steps
Symposium on Discrete Algorithms (SODA)
BibTeX Search WWW PDF   [GePP03a]
R. Gentilini and C. Piazza and A. Policriti
From Bisimulation to Simulation - Coarsest Partition Problems
Journal of Automated Reasoning
BibTeX Search WWW PDF   [GePo03]
R. Gentilini and A. Policriti
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
International Symposium on Algorithms and Computation (ISAAC)

2002

BibTeX Search WWW PDF   [DGPP02]
A. Dovier and R. Gentilini and C. Piazza and A. Policriti
Rank-Based Symbolic Bisimulation (and Model Checking)
Electronic Notes in Theoretical Computer Science (ENTCS)
BibTeX Search WWW PDF   [GePP02]
R. Gentilini and C. Piazza and A. Policriti
Simulation as Coarsest Partition Problem
Tools and Algorithms for the Construction and Analysis of Systems (TACAS)
BibTeX Search WWW PDF   [GePP02a]
R. Gentilini and C. Piazza and A. Policriti
Simulation Reduction as Constraint
Electronic Notes in Theoretical Computer Science (ENTCS)

           

Embedded Systems Group