On the Representation of Timed Polyhedra

نویسندگان

  • Olivier Bournez
  • Oded Maler
چکیده

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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reachability analysis for timed automata using max-plus algebra

We show that max-plus polyhedra are usable as a data structure in reachability analysis of timed automata. Drawing inspiration from the extensive work that has been done on difference bound matrices, as well as previous work on max-plus polyhedra in other areas, we develop the algorithms needed to perform forward and backward reachability analysis using maxplus polyhedra. To show that the appro...

متن کامل

Modelling Decision Problems Via Birkhoff Polyhedra

A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...

متن کامل

Symbolic Simulation-Checking of Dense-Time Systems

Intuitively, an (implementation) automata is simulated by a (specification) automata if every externally observable transition by the implementation automata can also be made by the specification automata. In this work, we present a symbolic algorithm for the simulation-checking of timed automatas. We first present a simulation-checking procedure that operates on state spaces, representable wit...

متن کامل

Susceptibility of three Eco-races of tropical Tasar silkworm to Antheraea mylitta cytoplasmic polyhedrosis virus (AmCPV)

Pathogenic infection in tasar silkworm, Antheraea mylitta Drury. is common and there is a breed specific response regarding tolerance. Observations reveal the possibility of differential response by haemocytes to microbial infection in different breeds. Hence, the susceptibility of three eco-races of tasar silkworm viz. Daba, Sarihan and Raily to Antheraea mylitta Cytoplasmic Polyhedrosis Virus...

متن کامل

On Canonical Representations of Convex Polyhedra

Every convex polyhedron in the Euclidean space Rd admits both H-representation and V-representation. When working with convex polyhedra, in particular largescale ones in high dimensions, it is useful to have a canonical representation that is minimal and unique up to some elementary operations. Such a representation allows one to compare two H-polyhedra or two V-polyhedra efficiently. In this p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000