Model Checking LTL over Controllable Linear Systems Is Decidable
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata or rectangular hybrid systems. In this paper we enlarge the class of systems amenable to algorithmic analysis and synthesis by showing decidability of model checking Linear Temporal Logic (LTL) formulas over discrete time, controllable, linear systems. This result follows from the construction of a language equivalent, finite abstraction of a control system based on a set of finite observations which correspond to the atomic propositions appearing in a given LTL formula. Furthermore, the size of this abstraction is shown to be polynomial in the dimension of the control system and the number of observations. These results open the doors for verification and synthesis of continuous and hybrid control systems from LTL specifications.
Supplementary Material (0)
- R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. Hybrid automata: An algorithmic approach to specification and verification of hybrid systems. Theoretical Computer Science, 138:3–34, 1995. CrossRef
- R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994. CrossRef
- Rajeev Alur, Thomas A. Henzinger, Gerardo Lafferriere, and George J. Pappas. Discrete abstractions of hybrid systems. Proceedings of the IEEE, 88:971–984, 2000.
- E. Asarin, G. Schneider, and S. Yovine. On the decidability of the reachability problem for planar differential inclusions. In M. D. Di Benedetto and A. Sangiovanni-Vincentelli, editors, Hybrid Systems: Computation and Control, volume 2034 of Lecture Notes in Computer Science, pages 89–104. Springer-Verlag, 2001. CrossRef
- A. Bemporad and M. Morari. Control of systems integrating logic, dynamics and constraints. Automatica, 35(3):407–427, 1999. CrossRef
- Mireille Broucke. A geometric approach to bisimulation and verification of hybrid systems. In Fritz W. Vaandrager and Jan H. van Schuppen, editors, Hybrid Systems: Computation and Control, volume 1569 of Lecture Notes in Computer Science, pages 61–75. Springer-Verlag, 1999. CrossRef
- P. Brunovsky. A classification of linear controllable systems. Kybernetika, 6(3):173–188, 1970.
- Edmund M. M. Clarke, Doron Peled, and Orna Grumberg. Model Checking. MIT Press, 1999.
- J.E.R. Cury, B.H. Krogh, and T. Niinomi. Synthesis of supervisory controllers for hybrid systems based on approximating automata. IEEE Transactions on Automatic Control: Special Issue on Hybrid Systems, 43(4):564–568, April 1998. CrossRef
- E. A. Emerson. Handbook of Theoretical Computer Science, volume B, chapter Temporal and modal logic, pages 995–1072. Elsevier Science, 1990.
- E. A. Emerson and E. M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241–266, 1982. CrossRef
- L.C.G.J.M. Habets and J. H. van Schuppen. Control of piecewise-linear hybrid systems on simplices and rectangles. In M. D. Di Benedetto and A. Sangiovanni-Vincentelli, editors, Hybrid Systems: Computation and Control, volume 2034 of Lecture Notes in Computer Sience, pages 261–274. Springer-Verlag, 2001.
- T.A. Henzinger and R. Majumdar. Symbolic model checking for rectangular hybrid systems. In S. Graf, editor, TACAS 2000: Tools and algorithms for the construction and analysis of systems, Lecture Notes in Computer Science, New-York, 2000. Springer-Verlag.
- Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What’s decidable about hybrid automata? Journal of Computer and System Sciences, 57:94–124, 1998. CrossRef
- R. E. Kalman. Kronecker invariants and feedback. In L. Weiss, editor, Ordinary Differential Equations, pages 459–471. Academic Press, New York, 1972.
- Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, and Moshe Y. Vardi. Open systems in reactive environments: Control and synthesis. In Proceedings of the 11th International Conference on Concurency Theory, volume 1877 of Lecture Notes in Computer Science, pages 92–107. Springer-Verlag, 2000.
- Gerardo Lafferriere, George J. Pappas, and Shankar Sastry. O-minimal hybrid systems. Mathematics of Control, Signals and Systems, 13(1):1–21, March 2000. CrossRef
- P. Madhusudan and P.S. Thiagarajan. Branching time controllers for discrete event systems. Theoretical Computer Science, 274:117–149, March 2002.
- Z. Manna and P. Wolper. Synthesis of communication processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6:68–93, 1984. CrossRef
- K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
- R. Milner. Communication and Concurrency. Prentice Hall, 1989.
- T. Moor and J. M. Davoren. Robust controller synthesis for hybrid systems using modal logic. In M. D. Di Benedetto and A. Sangiovanni-Vincentelli, editors, Hybrid Systems: Computation and Control, volume 2034 of Lecture Notes in Computer Science. Springer-Verlag, 2001. CrossRef
- eorge J. Pappas. Bisimilar linear systems. Automatica, 2001. To appear.
- D.M.R. Park. Concurrency and automata on infinite sequences, volume 104 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
- A. Puri and P. Varaiya. Decidability of hybrid systems with rectangular inclusions. In Computer Aided Verification, pages 95–104, 1994.
- Eduardo D. Sontag. Mathematical Control Theory, volume 6 of Texts in Applied Mathematics. Springer-Verlag, New-York, 2nd edition, 1998.
- Colin Stirling. Handbook of logic in computer science, volume 2, chapter Modal and Temporal Logics, pages 477–563. Oxford University Press, 1992.
- J.A. Stiver, X.D. Koutsoukos, and P.J. Antsaklis. An invariant based approach to the design of hybrid control systems. International Journal of Robust and Nonlinear Control, 11(5):453–478, 2001. CrossRef
- Paulo Tabuada and George J. Pappas. Finite bisimulations of controllable linear systems. Theoretical Computer Science, January 2003. Submitted, available at http://www.seas.upenn.edu/~tabuadap.
About this Chapter
- Model Checking LTL over Controllable Linear Systems Is Decidable
- Book Title
- Hybrid Systems: Computation and Control
- Book Subtitle
- 6th International Workshop, HSCC 2003 Prague, Czech Republic, April 3–5, 2003 Proceedings
- pp 498-513
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.