Convex Hull of Arithmetic Automata

Details Convex Hull of Arithmetic Automata Convex Hull of Arithmetic Automata

2008-12-10

arxiv.org/abs/0812.2014v1

Static Analysis, Valencia : Espagne (2008)

Computer Science

Data Structures and Algorithms

Scientific paper

10.1007/978-3-540-69166-2_4

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm computing the linear constraints defining these convex set is provided. Such an algorithm is useful for effectively extracting geometrical properties of the whole set of solutions of complex constraints symbolically represented by arithmetic automata.

Affiliated with

Also associated with

No associations

Rating

Convex Hull of Arithmetic Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convex Hull of Arithmetic Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Hull of Arithmetic Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-59805