Title
Finite abstractions for hybrid systems with stable continuous dynamics
Abstract
This paper outlines an abstraction process in which a particular class of hybrid automata with continuous dynamics that have parameterized positive limit sets, are being abstracted into finite transition systems. The limit sets with their corresponding attraction regions define pre- and post-conditions for the continuous dynamics, and determine the transitions in the discrete abstraction. An observable (weak) bisimulation equivalence is established between the two models. The abstraction process described can find application in verification, as well as in planning and symbolic control.
Year
DOI
Venue
2012
10.1007/s10626-011-0119-6
Discrete Event Dynamic Systems
Keywords
Field
DocType
Abstraction,Hybrid systems,Symbolic control
Discrete mathematics,Parameterized complexity,Observable,Abstraction,Automaton,Theoretical computer science,Hybrid system,Bisimulation equivalence,Mathematics
Journal
Volume
Issue
ISSN
22
1
0924-6703
Citations 
PageRank 
References 
4
0.48
20
Authors
5
Name
Order
Citations
PageRank
Herbert Tanner192191.72
Jie Fu2222.59
Chetan Rawal3151.60
Jorge Piovesan4102.36
Chaouki T. Abdallah520934.98