skip to main content
10.1145/3178126.3178143acmconferencesArticle/Chapter ViewAbstractPublication PagescpsweekConference Proceedingsconference-collections
research-article

Multi-Layered Abstraction-Based Controller Synthesis for Continuous-Time Systems

Published:11 April 2018Publication History

ABSTRACT

We present multi-layered abstraction-based controller synthesis, which extends standard abstraction-based controller synthesis (ABCS) algorithms for continuous-time control systems by simultaneously maintaining several "layers" of abstract systems with decreasing precision. The resulting abstract multi-layered controller uses the coarsest abstraction whenever this is feasible, and dynamically adjusts the precision---by moving to a more precise abstraction and back to a coarser abstraction---based on the structure of the given control problem. Abstract multi-layered controllers can be refined to controllers with non-uniform resolution using feedback refinement relations established between each abstract layer and the concrete system, resulting in a sound ABCS method. We provide multi-layered controller synthesis algorithms for reachability, safety, and generalized Büchi specifications; our approach can be generalized to any ω-regular objective. Our algorithms are complete relative to single-layered synthesis on the finest layer. We empirically demonstrate that multi-layered synthesis can outperform standard (single-layer) ABCS algorithms on a number of examples, despite the additional cost of constructing multiple abstract systems.

References

  1. R. Bloem, B. Jobstmann, N. Piterman, A. Pnueli, and Y. Sa'ar. Synthesis of reactive(1) designs. Journal of Computer and System Sciences, 78(3):911--938, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Bradfield and C. Stirling. Modal mu-calculi. In The Handbook of Modal Logic, pages 721--756. Elsevier, 2006.Google ScholarGoogle Scholar
  3. J. Cámara, A. Girard, and G. Gössler. Safety controller synthesis for switched systems using multi-scale symbolic models. In CDC '11, pages 520--525, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  4. J. Cámara, A. Girard, and G. Gössler. Synthesis of switching controllers using approximately bisimilar multiscale abstractions. In HSCC, pages 191--200, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV 2000, pages 154--169. Springer, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 238--252. ACM, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In FOCS'91, pages 368--377, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Esmaeil Zadeh Soudjani and A. Abate. Adaptive and sequential gridding procedures for the abstraction and verification of stochastic processes. SIAM Journal on Applied Dynamical Systems, 12(2):921--956, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  9. A. Girard. Towards a multiresolution approach to linear control. TAC, 51(8):1261--1270, 2006.Google ScholarGoogle Scholar
  10. A. Girard, G. Gössler, and S. Mouelhi. Safety controller synthesis for incrementally stable switched systems using multiscale symbolic models. TAC, 61(6):1537--1549, 2016.Google ScholarGoogle ScholarCross RefCross Ref
  11. A. Girard, G. Pola, and P. Tabuada. Approximately bisimilar symbolic models for incrementally stable switched systems. TAC, 55(1):116--126, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  12. T. A. Henzinger, R. Jhala, and R. Majumdar. Counterexample-guided control. In ICALP, pages 886--902. Springer, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. R. Lindemann and S. M. LaValle. Multiresolution approach for motion planning under differential constraints. In ICRA, pages 139--144. IEEE, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  14. O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In STACS'95, volume 900 of LNCS, pages 229--242. Springer, 1995.Google ScholarGoogle Scholar
  15. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. Reissig, A. Weber, and M. Rungger. Feedback refinement relations for the synthesis of symbolic controllers. TAC, 62(4):1781--1796, 2017.Google ScholarGoogle ScholarCross RefCross Ref
  17. M. Rungger and M. Zamani. SCOTS: A tool for the synthesis of symbolic controllers. In HSCC'16, pages 99--104. ACM, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. P. Tabuada. Verification and control of hybrid systems: a symbolic approach. Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Y. Tazaki and J.-i. Imura. Discrete-state abstractions of nonlinear systems using multi-resolution quantizer. In HSCC, pages 351--365. Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. A. Weber, M. Rungger, and G. Reissig. Optimized state space grids for abstractions. TAC, 2016.Google ScholarGoogle Scholar
  1. Multi-Layered Abstraction-Based Controller Synthesis for Continuous-Time Systems

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      HSCC '18: Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)
      April 2018
      296 pages
      ISBN:9781450356428
      DOI:10.1145/3178126

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 11 April 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

      Acceptance Rates

      Overall Acceptance Rate153of373submissions,41%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader