Computer Science – Systems and Control
Scientific paper
2012-03-29
Computer Science
Systems and Control
Technical report accompanying a paper to be presented in ADHS 2012
Scientific paper
In this paper we present an abstraction algorithm that produces a finite bisimulation quotient for an autonomous discrete-time linear system. We assume that the bisimulation quotient is required to preserve the observations over an arbitrary, finite number of polytopic subsets of the system state space. We generate the bisimulation quotient with the aid of a sequence of contractive polytopic sublevel sets obtained via a polyhedral Lyapunov function. The proposed algorithm guarantees that at iteration $i$, the bisimulation of the system within the $i$-th sublevel set of the Lyapunov function is completed. We then show how to use the obtained bisimulation quotient to verify the system with respect to arbitrary Linear Temporal Logic formulas over the observed regions.
Belta Calin
Ding Xuchu
Lazar Mircea
No associations
LandOfFree
Formal Abstraction of Linear Systems via Polyhedral 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 Formal Abstraction of Linear Systems via Polyhedral Lyapunov Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal Abstraction of Linear Systems via Polyhedral Lyapunov Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-56989