# On the representation of timed polyhedra

1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Mots-clés :
Document type :
Reports
Domain :

https://hal.inria.fr/inria-00099072
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:50:20 AM
Last modification on : Friday, May 13, 2022 - 10:18:05 PM
Long-term archiving on: : Friday, November 25, 2016 - 11:41:46 AM

### Identifiers

• HAL Id : inria-00099072, version 1

### Citation

Olivier Bournez, Oded Maler. On the representation of timed polyhedra. [Intern report] A00-R-079 || bournez00a, 2000. ⟨inria-00099072⟩

Record views