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

Estimator-based reactive synthesis under incomplete information

Published:14 April 2015Publication History

ABSTRACT

Lack of complete run-time information about the environment behavior significantly increases the computational complexity and limits the applicability of practical reactive synthesis methods, e.g., synthesis from generalized reactivity( 1) specifications. We tackle this difficulty by splitting incomplete-information controller synthesis into estimator construction and complete-information synthesis steps. The estimator, which executes in parallel to the controller, establishes approximations of the unobserved variables that are salient for the synthesis step. It essentially provides an abstraction from the belief space of the controller, whose exponential growth often plagues incomplete-information synthesis, by keeping track of only the properties of relevance for the specification engineer and the scenario under consideration.

We formalize an estimator notion for controller synthesis, and present a framework in which such estimators work in concert with controllers reacting partly to the estimator outputs to realize given temporal logic specifications. In order to limit the size and structure of the estimators, we focus on positional estimators in computation. Moreover, we demonstrate how such estimators are well-suited to be used in the context of generalized reactivity(1) synthesis. We illustrate the use of the estimator-based synthesis method on a running example motivated by intelligent transportation systems.

References

  1. A. Balluchi, L. Benvenuti, M. D. Di Benedetto, and A. L. Sangiovanni-Vincentelli. Design of observers for hybrid systems. In HSCC, pages 76--89. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Bloem, S. J. Galler, B. Jobstmann, N. Piterman, A. Pnueli, and M. Weiglhofer. Specify, compile, run: Hardware from PSL. Electr. Notes Theor. Comput. Sci., 190(4): 3--16, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. Bloem, B. Jobstmann, N. Piterman, A. Pnueli, and Y. Sa'ar. Synthesis of reactive(1) designs. J. Comput. Syst. Sci., 78(3): 911--938, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. E. Caines, R. Greiner, and S. Wang. Classical and logic-based dynamic observers for finite automata. IMA Journal of Mathematical Control and Information, 8(1): 45--80, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  5. W. Damm, S. Disch, H. Hungar, S. Jacobs, J. Pang, F. Pigorsch, C. Scholl, U. Waldmann, and B. Wirtz. Exact state set representations in the verification of linear hybrid systems with large discrete state space. In ATVA, pages 425--440, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Delvecchio, R. M. Murray, and E. Klavins. Discrete state estimators for systems on a lattice. Automatica, 42(2): 271--285, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Ehlers, V. Raman, and C. Finucane. Slugs GR(1) synthesizer, 2013--2015. Available at https://github.com/LTLMoP/slugs.Google ScholarGoogle Scholar
  8. G. Kalyon, T. L. Gall, H. Marchand, and T. Massart. Global state estimates for distributed systems. In Formal Techniques for Distributed Systems, pages 198--212, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. H. Kress-Gazit, T. Wongpiromsarn, and U. Topcu. Correct, reactive robot control from abstraction and temporal logic specifications. IEEE Robotics and Automation Magazine, 18(3): 65--74, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  10. O. Kupferman and M. Vardi. Synthesis with incomplete informatio. In 2nd International Conference on Temporal Logic, pages 91--106, Manchester, July 1997.Google ScholarGoogle Scholar
  11. D. G. Luenberger. Optimization by vector space methods. John Wiley & Sons, 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Oishi, I. Hwang, and C. Tomlin. Immediate observability of discrete event systems with application to user-interface design. In CDC, pages 2665--2672, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  13. C. M. Ozveren and A. S. Willsky. Observability of discrete event dynamic systems. IEEE Transactions on Automatic Control, 35(7): 797--806, 1990.Google ScholarGoogle ScholarCross RefCross Ref
  14. J. H. Reif. The complexity of two-player games of incomplete information. Journal of Computer and System Sciences, 29(2): 274--301, 1984.Google ScholarGoogle ScholarCross RefCross Ref
  15. R. D. Smallwood and E. J. Sondik. The optimal control of partially observable markov processes over a finite horizon. Operations Research, 21: 1071--1088, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. Sohail and F. Somenzi. Safety first: a two-stage algorithm for the synthesis of reactive systems. STTT, 15(5--6): 433--454, 2013.Google ScholarGoogle Scholar
  17. D. C. Tarraf, A. Megretski, and M. A. Dahleh. Finite approximations of switched homogeneous systems for controller synthesis. IEEE Trans. Automat. Contr., 56(5): 1140--1145, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  18. Y. Velner and A. Rabinovich. Church synthesis problem for noisy input. In FOSSACS, pages 275--289, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. Walker and L. Ryzhyk. Predicate abstraction for reactive synthesis. In FMCAD, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Estimator-based reactive synthesis under incomplete information

    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 '15: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control
      April 2015
      321 pages
      ISBN:9781450334334
      DOI:10.1145/2728606

      Copyright © 2015 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: 14 April 2015

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate153of373submissions,41%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader