Symbolic Models for Nonlinear Control Systems: Alternating Approximate Bisimulations

Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growing interest in the use of symbolic models as a tool for mitigating complexity in control design. In fact, symbolic models enable the use of well-known algorithms in the context of supervisory control and algorithmic game theory for controller synthesis. Since the 1990s many researchers faced the problem of identifying classes of dynamical and control systems that admit symbolic models. In this paper we make further progress along this research line by focusing on control systems affected by disturbances. Our main contribution is to show that incrementally globally asymptotically stable nonlinear control systems with disturbances admit symbolic models.

[1]  P. Varaiya,et al.  What ' s Decidable about Hybrid Automata ? 1 , 1995 .

[2]  Dusan M. Stipanovic,et al.  Polytopic Approximations of Reachable Sets Applied to Linear Dynamic Games and a Class of Nonlinear Systems , 2005 .

[3]  Paulo Tabuada.  Approximate Simulation Relations and Finite Abstractions of Quantized Control Systems , 2007, HSCC.

[4]  Jörg Raisch,et al.  Discrete Supervisory Control of Hybrid Systems Based on l-Complete Approximations , 2002, Discret. Event Dyn. Syst..

[5]  A. J. van der Schaft,et al.  Equivalence of dynamical systems by bisimulation , 2004, IEEE Transactions on Automatic Control.

[6]  Martin Wirsing,et al.  Approximate Bisimilarity , 2000, AMAST.

[7]  Yuandan Lin,et al.  A Smooth Converse Lyapunov Theorem for Robust Stability , 1996 .

[8]  David Angeli,et al.  A Lyapunov approach to incremental stability properties , 2002, IEEE Trans. Autom. Control..

[9]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

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

[11]  Eduardo Sontag,et al.  Forward Completeness, Unboundedness Observability, and their Lyapunov Characterizations , 1999 .

[12]  Thomas A. Henzinger,et al.  Quantifying Similarities Between Timed Systems , 2005, FORMATS.

[13]  Antoine Girard.  Approximately Bisimilar Finite Abstractions of Stable Linear Systems , 2007, HSCC.

[14]  Zhiwu Li,et al.  ON SUPERVISORY CONTROL OF A CLASS OF DISCRETE EVENT SYSTEMS , 2006 .

[15]  E. Yaz.  Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[16]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[17]  Pravin Varaiya,et al.  Reach Set Computation Using Optimal Control , 2000 .

[18]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[19]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[20]  Paulo Tabuada,et al.  Symbolic models for linear control systems with disturbances , 2007, 2007 46th IEEE Conference on Decision and Control.

[21]  Pravin Varaiya,et al.  Decidability of Hybrid Systems with Rectangular Differential Inclusion , 1994, CAV.

[22]  Paulo Tabuada.  Symbolic control of linear systems based on symbolic subsystems , 2006, IEEE Transactions on Automatic Control.

[23]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[24]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[25]  Paulo Tabuada,et al.  Linear Time Logic Control of Discrete-Time Linear Systems , 2006, IEEE Transactions on Automatic Control.

[26]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[27]  P. Caines,et al.  Hierarchical hybrid control systems: a lattice theoretic formulation , 1998, IEEE Trans. Autom. Control..

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

[29]  Stephan Merz,et al.  Model Checking , 2000 .

[30]  Fernando Paganini,et al.  IEEE Transactions on Automatic Control , 2006 .

[31]  K. Fernow.  New York , 1896, American Potato Journal.

[32]  Jan Lunze,et al.  A discrete-event model of asynchronous quantised systems , 2002, Autom..

[33]  P.J. Antsaklis,et al.  Supervisory control of hybrid systems , 2000, Proceedings of the IEEE.

[34]  Paulo Tabuada,et al.  Symbolic models for control systems , 2007, Acta Informatica.

[35]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

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

[37]  Joseph Sifakis,et al.  An Approach to the Description and Analysis of Hybrid Systems , 1992, Hybrid Systems.

[38]  Pravin Varaiya,et al.  Ellipsoidal Techniques for Reachability Analysis , 2000, HSCC.

[39]  P. Varaiya,et al.  Differential games , 1971 .

[40]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[41]  David L. Dill.  Proceedings of the 6th International Conference on Computer Aided Verification , 1994 .

[42]  Antoine Girard,et al.  Reachability of Uncertain Linear Systems Using Zonotopes , 2005, HSCC.

[43]  Eduardo Sontag.  Input to State Stability: Basic Concepts and Results , 2008 .

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

[45]  Arjan van der Schaft,et al.  Equivalence of dynamical systems by bisimulation , 2004, IEEE Trans. Autom. Control..

[46]  Abraham Adolf Fraenkel,et al.  Set theory and logic , 1966 .