Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Modeling and Analysis of Hybrid Systems Algorithmic analysis for linear hybrid systems
 

Summary: Modeling and Analysis of Hybrid Systems
Algorithmic analysis for linear hybrid systems
Prof. Dr. Erika Ábrahám
Informatik 2 - Theory of Hybrid Systems
RWTH Aachen University
SS 2011
Ábrahám - Modeling and Analysis of Hybrid Systems 1 / 41
Literature
Alur et al.: The algorithmic analysis of hybrid systems
Theoretical Computer Science, 138(1):3­34, 1995
Ábrahám - Modeling and Analysis of Hybrid Systems 2 / 41
Linear hybrid automata
A linear term e over a set Var = {x1, . . . , xn} of variables is a linear
combination n
i=1 cixi of variables in Var with integer (rational)
coefficients ci.
A linear constraint t over Var is an (in)equality e1 e2 with
{>, , =, , <} between linear terms over Var.
A hybrid system is time-deterministic iff for every location l Loc and
every valuation V there is at most one activity f Act(l) with

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences