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 What's decidable about hybrid automata?
 

Summary: Modeling and Analysis of Hybrid Systems
What's decidable about hybrid automata?
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 / 1
Literature
Henzinger et al.: What's decidable about hybrid automata?
Journal of Computer and System Sciences, 57:94­124, 1998
Ábrahám - Modeling and Analysis of Hybrid Systems 2 / 1
Motivation
The special class of timed automata with TCTL is decidable, thus
model checking is possible.
What about other classes of hybrid systems?
Ábrahám - Modeling and Analysis of Hybrid Systems 3 / 1
What is decidable about hybrid automata?
Two central problems for the analysis of hybrid automata:
Safety: The problem to decide if something "bad" can happend during
the execution of a system.

  

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

 

Collections: Computer Technologies and Information Sciences