Computing augmented finite transition systems to synthesize switching protocols for polynomial switched systems
- 1 June 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 07431619,p. 6237-6244
Abstract
This work is motivated by the problem of synthesizing mode sequences for continuous-time polynomial switched systems in order to guarantee that the trajectories of the system satisfy certain high-level specifications expressed in linear temporal logic. We use augmented finite transition systems as abstract models of continuous switched systems. Augmented finite transition systems are equipped with liveness properties that can be used to enforce progress in accordance with the underlying dynamics. We then introduce abstraction and refinement relations that induce a preorder on this class of finite transition systems. By construction, the resulting preorder respects the feasibility (i.e., realizability) of the synthesis problem. Hence, existence of a discrete switching strategy for one of these abstract finite transition systems guarantees the existence of a mode sequence for the continuous system such that all of its trajectories satisfy the specification. We also present an algorithm, which can be implemented using sum-of-squares based relaxations, to compute such high fidelity abstract models in a computationally tractable way. Finally, these ideas are illustrated on an example.Keywords
This publication has 25 references indexed in Scilit:
- Synthesis of Reactive(1) designsJournal of Computer and System Sciences, 2012
- Synthesis for Constrained Nonlinear Systems Using Hybridization and Robust Controllers on SimplicesIEEE Transactions on Automatic Control, 2011
- Temporal logic motion planning for dynamic robotsAutomatica, 2009
- Abstractions for hybrid systemsFormal Methods in System Design, 2007
- Counterexample-guided predicate abstraction of hybrid systemsTheoretical Computer Science, 2006
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- Verification of Hybrid Systems Based on Counterexample-Guided Abstraction RefinementLecture Notes in Computer Science, 2003
- Switching between stabilizing controllersAutomatica, 2002
- Verification by Augmented Finitary AbstractionInformation and Computation, 2000
- Basic problems in stability and design of switched systemsIEEE Control Systems, 1999