Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Polyhedral Flows in Hybrid Automata y Rajeev Alur 1z Sampath Kannan 1x Salvatore La Torre 2{
 

Summary: Polyhedral Flows in Hybrid Automata y
Rajeev Alur 1z Sampath Kannan 1x Salvatore La Torre 2{
1 University of Pennsylvania
2 Universita degli Studi di Salerno
alur,kannan @cis.upenn.edu, slatorre @unisa.it
Abstract
A hybrid automaton is a mathematical model for hybrid systems, which combines, in a sin-
gle formalism, automaton transitions for capturing discrete updates with di erential constraints for
capturing continuous ows. Formal veri cation of hybrid automata relies on symbolic xpoint com-
putation procedures that manipulate sets of states. These procedures can be implemented using
boolean combinations of linear constraints over system variables, equivalently, using polyhedra, for
the subclass of linear hybrid automata. In a linear hybrid automaton, the ow at each control mode is
given by a rate polytope that constrains the allowed values of the rst derivatives. The key property
of such a ow is that, given a state-set described by a polyhedron, the set of states that can be reached
as time elapses, is also a polyhedron. We call such a ow a polyhedral ow. In this paper, we study
if we can generalize the syntax of linear hybrid automata for describing ows without sacri cing the
polyhedral property. In particular, we consider ows described by origin-dependent rate polytopes,
in which the allowed rates depend, not only on the current control mode, but also on the speci c
state at which the mode was entered. We identify necessary and suĂcient conditions for a class of
ows described by origin-dependent rate polytopes to be polyhedral. We also propose and study

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences