|
Evènement pour le groupe Modélisation et Verification
Date | 2010-05-20 11:30-12:45 |
Titre | Implicit 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 |
Lieu | Salle 076, LaBRI, Rez-de-chaussée |
Orateur | Bernard Boigelot |
Email | boigelot@montefiore.ulg.ac.be |
Url | Institut Montefiore (Liège, Belgique) |
Aucun document lié à cet événement. RetourRetour à l'index
| |