Bounding Errors Due to Switching Delays in Incrementally Stable Switched Systems (Extended Version)

Time delays pose an important challenge in networked control systems, which are now ubiquitous. Focusing on switched systems, we introduce a framework that provides an upper bound for errors caused by switching delays. Our framework is based on approximate bisimulation, a notion that has been previously utilized mainly for symbolic (discrete) abstraction of state spaces. Notable in our framework is that, in deriving an approximate bisimulation and thus an error bound, we use a simple incremental stability assumption (namely {\delta}-GUAS) that does not itself refer to time delays. That this is the same assumption used for state-space discretization enables a two-step workflow for control synthesis for switched systems, in which a single Lyapunov-type stability witness serves for two different purposes of state discretization and coping with time delays. We demonstrate the proposed framework with a boost DC-DC converter, a common example of switched systems.

[1]  Paulo Tabuada,et al.  Approximately bisimilar symbolic models for nonlinear control systems , 2007, Autom..

[2]  Antoine Girard,et al.  Approximate Bisimulation: A Bridge Between Computer Science and Control Theory , 2011, Eur. J. Control.

[3]  Houssam Abbas,et al.  Formal property verification in a conformance testing framework , 2014, 2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE).

[4]  A.G. Beccuti,et al.  Optimal Control of the Boost dc-dc Converter , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[5]  Maria Domenica Di Benedetto,et al.  Alternating approximately bisimilar symbolic models for nonlinear control systems with unknown time-varying delays , 2010, 49th IEEE Conference on Decision and Control (CDC).

[6]  Maria Domenica Di Benedetto,et al.  A symbolic approach to the design of nonlinear networked control systems , 2012, HSCC '12.

[7]  Antoine Girard,et al.  Verification and Synthesis of Timing Contracts for Embedded Controllers , 2016, HSCC.

[8]  Igor Walukiewicz,et al.  Games for synthesis of controllers with partial observation , 2003, Theor. Comput. Sci..

[9]  Antoine Girard,et al.  Synthesis using approximately bisimilar abstractions: state-feedback controllers for safety specifications , 2010, HSCC '10.

[10]  Antoine Girard,et al.  Approximation Metrics for Discrete and Continuous Systems , 2006, IEEE Transactions on Automatic Control.

[11]  M. Branicky.  Multiple Lyapunov functions and other analysis tools for switched and hybrid systems , 1998, IEEE Trans. Autom. Control..

[12]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[13]  Manuel Mazo,et al.  Symbolic Abstractions of Networked Control Systems , 2018, IEEE Transactions on Control of Network Systems.

[14]  Paulo Tabuada,et al.  Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems , 2008, IEEE Transactions on Automatic Control.

[15]  Jun Liu,et al.  Finite abstractions with robustness margins for temporal logic-based control synthesis , 2016 .

[16]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[17]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[18]  Paulo Tabuada,et al.  Symbolic Models for Nonlinear Control Systems: Alternating Approximate Bisimulations , 2007, SIAM J. Control. Optim..

[19]  Houssam Abbas,et al.  Towards composition of conformant systems , 2015, ArXiv.

[20]  Paulo Tabuada,et al.  Symbolic models for nonlinear time-delay systems using approximate bisimulations , 2010, Syst. Control. Lett..

[21]  A. Bacciotti,et al.  Stability and Stabilization of Discontinuous Systems and Nonsmooth Lyapunov Functions , 1999 .

[22]  Antoine Girard,et al.  Scheduling of Embedded Controllers Under Timing Contracts , 2017, HSCC.

[23]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.