Computer Science – Systems and Control
Scientific paper
2010-08-19
Computer Science
Systems and Control
Scientific paper
In this report proofs are presented for a method for abstracting continuous dynamical systems by timed automata. The method is based on partitioning the state space of dynamical systems with invariant sets, which form cells representing locations of the timed automata. To enable verification of the dynamical system based on the abstraction, conditions for obtaining sound, complete, and refinable abstractions are set up. It is proposed to partition the state space utilizing sub-level sets of Lyapunov functions, since they are positive invariant sets. The existence of sound abstractions for Morse-Smale systems and complete and refinable abstractions for linear systems are proved.
Sloth Christoffer
Wisniewski Rafael
No associations
LandOfFree
Proofs for an Abstraction of Continuous Dynamical Systems Utilizing Lyapunov Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Proofs for an Abstraction of Continuous Dynamical Systems Utilizing Lyapunov Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proofs for an Abstraction of Continuous Dynamical Systems Utilizing Lyapunov Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-134660