Abstract
Abstractions (also called symbolic models) are simple descriptions of continuous and hybrid systems that can be used in analysis and control. They are usually constructed in the form of transition systems with finitely many states. Such abstractions offer a very attractive approach to deal with complexity, while at the same time allowing for rich specification languages. Recent results show that, through the abstraction process, the resulting transition systems can be nondeterministic (i.e., if an input is applied in a state, several next states are possible). However, the problem of controlling a nondeterministic transition system from a rich specification such as a temporal logic formula is not well understood. In this paper, we develop a control strategy for a nondeterministic transition system from a specification given as a Linear Temporal Logic formula with a deterministic Büchi generator. Our solution is inspired by LTL games on graphs, is complete, and scales polynomially with the size of the Büchi automaton. An example of controlling a linear system from a specification given as a temporal logic formula over the regions of its triangulated state space is included for illustration.
This work is partially supported by NSF CAREER 0447721 and NSF 0410514 at Boston University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Milner, R.: Communication and concurrency. Prentice-Hall, Englewood CliDs, NJ (1989)
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.H.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 209–229. Springer, Heidelberg (1993)
Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What is decidable about hybrid automata? J. Comput. Syst. Sci. 57, 94–124 (1998)
Lafferriere, G., Pappas, G.J., Sastry, S.: O-minimal hybrid systems. Math. Control, Signals, Syst 13(1), 1–21 (2000)
Tabuada, P., Pappas, G.J.: Linear time logic control of discrete-time linear systems. IEEE Transactions on Automatic Control 51(12), 1862–1877 (2006)
Tabuada, P.: Symbolic control of linear systems based on symbolic subsystems. IEEE Transactions on Automatic Control 51(6), 1003–1013 (2006)
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)
Alur, R., Dang, T., Ivancic, F.: Reachability analysis of hybrid systems via predicate abstraction. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, Springer, Heidelberg (2002)
Tiwari, A., Khanna, G.: Series of abstractions for hybrid automata. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, Springer, Heidelberg (2002)
Belta, C., Habets, L.: Constructing decidable hybrid systems with velocity bounds. In: 43rd IEEE Conference on Decision and Control, Paradise Island, Bahamas (2004)
Habets, L., van Schuppen, J.: A control problem for affine dynamical systems on a full-dimensional polytope. Automatica 40, 21–35 (2004)
Belta, C., Habets, L.: Control of a class of nonlinear systems on rectangles. IEEE Transactions on Automatic Control 51(11), 1749–1759 (2006)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
Kloetzer, M., Belta, C.: A fully automated framework for control of linear systems from LTL specifications. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 333–347. Springer, Heidelberg (2006)
Habets, L., Collins, P., van Schuppen, J.: Reachability and control synthesis for piecewise-affine hybrid systems on simplices. IEEE Trans. Aut. Control 51, 938–948 (2006)
Kloetzer, M., Habets, L., Belta, C.: Control of rectangular multi-affine hybrid systems. In: 45th IEEE Conference on Decision and Control, San Diego, CA (2006)
Thomas, W.: Infinite games and verification. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 58–64. Springer, Heidelberg (2002)
Wallmeier, N., Hütten, P., Thomas, W.: Symbolic synthesis of finite-state controllers for request-response specifications. In: Proceedings of the International Conference on the Implementation and Application of Automata, pp. 11–22 (2003)
Piterman, N., Pnueli, A., Sa’ar, Y.: Synthesis of reactive(1) designs. In: Proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation, pp. 364–380 (2006)
Kloetzer, M., Belta, C.: Managing non-determinism in symbolic robot motion planning and control. In: IEEE International Conference on Robotics and Automation, Rome, Italy (2007)
Wolper, P., Vardi, M., Sistla, A.: Reasoning about infinite computation paths. In: Nagel, E., et al. (eds.) Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, Tucson, AZ, pp. 185–194 (1983)
Safra, S.: Complexity of automata on infinite objects. PhD thesis, The Weizman Institute of Science, Rehovot, Israel (1989)
Fainekos, G.E., Loizou, S.G., Pappas, G.J.: Translating temporal logic to controller specifications. In: 45th IEEE Conference on Decision and Control, San Diego, CA (2006)
Alur, R., Torre, S.L.: Deterministic generators and games for LTL fragments. In: 16th IEEE Symposium on Logic in Computer Science, LICS 2001, pp. 291–300 (2001)
Kumar, R., Garg, V.K.: Modeling and Control of Logical Discrete Event Systems. Kluwer, Boston, MA (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kloetzer, M., Belta, C. (2008). Dealing with Nondeterminism in Symbolic Control. In: Egerstedt, M., Mishra, B. (eds) Hybrid Systems: Computation and Control. HSCC 2008. Lecture Notes in Computer Science, vol 4981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78929-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-78929-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78928-4
Online ISBN: 978-3-540-78929-1
eBook Packages: Computer ScienceComputer Science (R0)