Skip to main navigation Skip to search Skip to main content

On the representation of timed polyhedra

  • LORIA Laboratoire Lorrain de Recherche en Informatique et ses Applications
  • Verimag

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analysis and in particular of verification tools based on timed automata. We define a representation scheme for these polyhedra based on their extreme vertices, and show that this compact representation scheme is canonical for all (convex and non-convex) polyhedra in any dimension. We then develop relatively efficient algorithms for membership, boolean operations, projection and passage of time for this representation.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings
EditorsUgo Montanari, Jose D. P. Rolim, Emo Welzl
PublisherSpringer Verlag
Pages793-807
Number of pages15
ISBN (Print)9783540450221
DOIs
Publication statusPublished - 1 Jan 2000
Externally publishedYes
Event27th International Colloquium on Automata, Languages and Programming, ICALP 2000 - Geneva, Switzerland
Duration: 9 Jul 200015 Jul 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1853
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Colloquium on Automata, Languages and Programming, ICALP 2000
Country/TerritorySwitzerland
CityGeneva
Period9/07/0015/07/00

Fingerprint

Dive into the research topics of 'On the representation of timed polyhedra'. Together they form a unique fingerprint.

Cite this