Approximately Bisimilar Symbolic Models for Digital Control Systems

  • Rupak Majumdar
  • Majid Zamani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7358)


Symbolic approaches to control hybrid systems construct a discrete approximately-bisimilar abstraction of a continuous control system and apply automata-theoretic techniques to construct controllers enforcing given specifications. For the class of digital control systems (i.e., whose control signals are piecewise constant) satisfying incremental input-to-state stability (δ-ISS), existing techniques to compute discrete abstractions begin with a quantization of the state and input sets, and show that the quantized system is approximately bisimilar to the original if the sampling time is sufficiently large or if the Lyapunov functions of the system decrease fast enough. If the sampling time is not sufficiently large, the former technique fails to apply. While abstraction based on Lyapunov functions may be applicable, because of the conservative nature of Lyapunov functions in practice, the size of the discrete abstraction may be too large for subsequent analyses.

In this paper, we propose a technique to compute discrete approximately-bisimilar abstractions of δ-ISS digital control systems. Our technique quantizes the state and input sets, but is based on multiple sampling steps: instead of requiring that the sampling time is sufficiently large (which may not hold), the abstract transition system relates states multiple sampling steps apart.

We show on practical examples that the discrete state sets computed by our procedure can be several orders of magnitude smaller than existing approaches, and can compute symbolic approximate-bisimilar models even when other existing approaches do not apply or time-out. Since the size of the discrete state set is the main limiting factor in the application of symbolic control, our results enable symbolic control of larger systems than was possible before.


Lyapunov Function Symbolic Model Nonlinear Control System Linear Control System Digital Control System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Control tutorial for Matlab and Simulink. Electronically available at,
  2. 2.
    Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Angeli, D.: A Lyapunov approach to incremental stability properties. IEEE Transactions on Automatic Control 47(3), 410–421 (2002)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Angeli, D., Sontag, E.D.: Forward completeness, unboundedness observability, and their Lyapunov characterizations. Systems and Control Letters 38, 209–217 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: FOCS 1991: Foundations of Computer Science, pp. 368–377. IEEE (1991)Google Scholar
  6. 6.
    Frehse, G., Le Guernic, C., Donzé, A., Cotton, S., Ray, R., Lebeltel, O., Ripado, R., Girard, A., Dang, T., Maler, O.: SpaceEx: Scalable Verification of Hybrid Systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 379–395. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    Girard, A.: Reachability of Uncertain Linear Systems Using Zonotopes. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 291–305. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Girard, A.: Approximately Bisimilar Finite Abstractions of Stable Linear Systems. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 231–244. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Girard, A., Pappas, G.J.: Approximation metrics for discrete and continuous systems. IEEE Transactions on Automatic Control 25(5), 782–798 (2007)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Girard, A., Pola, G., Tabuada, P.: Approximately bisimilar symbolic models for incrementally stable switched systems. IEEE Transactions on Automatic Control 55(1), 116–126 (2009)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Le Guernic, C., Girard, A.: Reachability analysis of linear systems using support functions. Nonlinear Analysis: Hybrid Systems 4(2), 250–262 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Henzinger, T.A.: Hybrid Automata with Finite Bisimulatioins. In: Fülöp, Z. (ed.) ICALP 1995. LNCS, vol. 944, pp. 324–335. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  13. 13.
    Kailath, T.: Linear systems. Prentice-Hall, Inc. (1980)Google Scholar
  14. 14.
    Maler, O., Pnueli, A., Sifakis, J.: On the Synthesis of Discrete Controllers for Timed Systems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 229–242. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  15. 15.
    Milner, R.: Communication and Concurrency. Prentice-Hall, Inc. (1989)Google Scholar
  16. 16.
  17. 17.
    Pola, G., Girard, A., Tabuada, P.: Approximately bisimilar symbolic models for nonlinear control systems. Automatica 44(10), 2508–2516 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Pola, G., Tabuada, P.: Symbolic models for nonlinear control systems: alternating approximate bisimulations. SIAM Journal on Control and Optimization 48(2), 719–733 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    Sontag, E.D.: Mathematical control theory, 2nd edn. Springer (1998)Google Scholar
  20. 20.
    Tabuada, P.: Verification and Control of Hybrid Systems, A symbolic approach. Springer, US (2009)zbMATHCrossRefGoogle Scholar
  21. 21.
    Teel, A.R., Nesic, D., Kokotovic, P.V.: A note on input-to-state stability of sampled-data nonlinear systems. In: CDC 1998: Conference on Decision and Control, pp. 2473–2478. IEEE (1998)Google Scholar
  22. 22.
    Thomas, W.: On the Synthesis of Strategies in Infinite Games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  23. 23.
    Zamani, M., Tabuada, P.: Backstepping design for incremental stability. IEEE Transaction on Automatic Control 56(9), 2184–2189 (2011)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Rupak Majumdar
    • 1
  • Majid Zamani
    • 2
  1. 1.Max Planck Institute for Software SystemsGermany
  2. 2.Department of Electrical EngineeringUniversity of CaliforniaLos AngelesUSA

Personalised recommendations