Reference : Implicit Real Vector Automata
Scientific congresses and symposiums : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/74767
Implicit Real Vector Automata
English
Boigelot, Bernard mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Informatique >]
Brusten, Julien mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Informatique >]
Degbomont, Jean-François mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Dép. d'électric., électron. et informat. (Inst.Montefiore) >]
2010
Electronic Proceedings in Theoretical Computer Science [=EPTCS]
39
63-76
Yes
No
International
2075-2180
12th International Workshop on Verification of Infinite-State Systems
September 21th, 2010
Singapore
Singapore
[en] Non-convex polyhedra ; Boolean combinations of linear constraints ; Data structure
[en] This paper addresses the symbolic representation of non-convex real polyhedra, i.e., sets of real vectors satisfying arbitrary Boolean combinations of linear constraints. We develop an original 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 polyhedra, is closed under Boolean operators, and admits an efficient decision procedure for testing the membership of a vector.
Interuniversity Attraction Poles program MoVES of the Belgian Federal Science Policy Office ; Grant 2.4530.02 of the Belgian Fund for Scientific Research (F.R.S.-FNRS)
Researchers ; Professionals ; Students
http://hdl.handle.net/2268/74767
10.4204/EPTCS.39.5

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
paper.pdfNo commentaryAuthor postprint273.75 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.