Evènement pour le groupe Modélisation et Verification


Date 2010-05-20  11:30-12:45
TitreImplicit Real Vector Automata 
RésuméThis work addresses the efficient handling of non-convex real polyhedra, i.e., sets of real vectors satisfying arbitrary Boolean combinations of linear constraints. We develop a symbolic data structure for representing such sets, based on an implicit and concise encoding of a known structure, the Real Vector Automaton. The resulting formalism provides a canonical representation of non-convex polyhedra, is closed under Boolean operators, and admits an efficient decision procedure for testing the membership of a vector. Joint work with Julien Brusten and Jean-François Degbomont 
LieuSalle 076, LaBRI, Rez-de-chaussée 
OrateurBernard Boigelot 
Emailboigelot@montefiore.ulg.ac.be 
UrlInstitut Montefiore (Liège, Belgique) 



Aucun document lié à cet événement.

Retour
Retour à l'index