Technical Report
Properties of Hybrid Systems - a Computer Science Perspective
Author(s): Thomas Stauner
Year: 2000
Number: TUM-I0017
Editor:
CR Classification: C.3, F.3.1
CR General Terms: Theory, Verification
Keywords: hybrid systems, stability, topology, refinement, verification
Abstract:Motivated by the work on hybrid, i.e. mixed discrete and continuous, systems, we
introduce a set of important properties of such systems and classify them.
For
the properties of stability and attraction which are central for continuous
systems we discuss their relationship to discrete systems usually studied in
computer science.
An essential result is that the meaning of these properties
for discrete systems vitally depends on the used topologies.
Based on the
classification we discuss the utility of a notion of refinement which we will
use in the future for property preserving transformations of hybrid systems.
Finally, two proof rules and some specializations of them are introduced for
proving stability and attraction. The rules result from adapting known
techniques from systems theory and are applied to small examples.
Available as compressed Postscript
BibTeX-Entry:
<![CDATA[
@techreport{Stauner00b,
author = {Thomas Stauner},
title = {Properties of Hybrid Systems - a Computer Science Perspective},
number = {TUM-I0017},
institution = {Technische Univerit\"at M\"unchen},
year = {2000},
url = {http://www4.informatik.tu-muenchen.de/reports/Stauner00b.html},
abstract = {Motivated by the work on hybrid, i.e. mixed discrete and continuous, systems, we
introduce a set of important properties of such systems and classify them.
For
the properties of stability and attraction which are central for continuous
systems we discuss their relationship to discrete systems usually studied in
computer science.
An essential result is that the meaning of these properties
for discrete systems vitally depends on the used topologies.
Based on the
classification we discuss the utility of a notion of refinement which we will
use in the future for property preserving transformations of hybrid systems.
Finally, two proof rules and some specializations of them are introduced for
proving stability and attraction. The rules result from adapting known
techniques from systems theory and are applied to small examples.},
CRClassification = {C.3, F.3.1},
CRGenTerms = {Theory, Verification}}
]]>