On the representation of timed polyhedra
Abstract
This paper studies the representation of ``timed polyhedra'', i.e. of polyhedra manipulated by synthesis and verification algorithms on timed automata. We propose several representation schemes for these polyhedra based on their vertices and show that these representations are canonical for all convex and non-convex timed polyhedra of any dimension. We then sketch algorithms for realizing boolean operations, equality tests, and time expansion operations.