Model checking LTL over controllable linear systems is decidable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2623, Issue , 2003, Pages 498-513

  Tabuada, Paulo ^a   Pappas, George J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; CONTROL SYSTEM SYNTHESIS; CONTROL SYSTEMS; HYBRID SYSTEMS; LINEAR SYSTEMS; TEMPORAL LOGIC;

ALGORITHMIC ANALYSIS; ALGORITHMIC VERIFICATION; ATOMIC PROPOSITIONS; CONTINUOUS DYNAMICS; FINITE ABSTRACTION; HYBRID CONTROL SYSTEMS; LINEAR TEMPORAL LOGIC; TIMED AUTOMATA;

MODEL CHECKING;

EID: 33745804741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36580-x_36     Document Type: Article

References (29)

1. 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.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. Rajeev Alur, Thomas A. Henzinger, Gerardo Lafferriere, and George J. Pappas. Discrete abstractions of hybrid systems. Proceedings of the IEEE, 88:971-984, 2000.
4. 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.
5. A. Bemporad and M. Morari. Control of systems integrating logic, dynamics and constraints. Automation, 35(3):407-427, 1999.
6. 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.
7. P. Brunovsky. A classification of linear controllable systems. Kybernetika, 6(3):173-188, 1970.
8. Edmund M. M. Clarke, Doron Peled, and Orna Grumberg. Model Checking. MIT Press, 1999.
9. 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.
10. E. A. Emerson. Handbook of Theoretical Computer Science, volume B, chapter Temporal and modal logic, pages 995-1072. Elsevier Science, 1990.
11. E. A. Emerson and E. M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241-266, 1982.
12. 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.
13. 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.
14. 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.
15. R. E. Kalman. Kronecker invariants and feedback. In L. Weiss, editor, Ordinary Differential Equations, pages 459-471. Academic Press, New York, 1972.
16. 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.
17. Gerardo Lafferriere, George J. Pappas, and Shankar Sastry. O-minimal hybrid systems. Mathematics of Control, Signals and Systems, 13(1):1-21, March 2000.
18. P. Madhusudan and P.S. Thiagarajan. Branching time controllers for discrete event systems. Theoretical Computer Science, 274:117-149, March 2002.
19. Z. Manna and P. Wolper. Synthesis of communication processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6:68-93, 1984.
20. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
21. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
22. 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.
23. George J. Pappas. Bisimilar linear systems. Automation, 2001. To appear.
24. D.M.R. Park. Concurrency and automata on infinite sequences, volume 104 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
25. A. Puri and P. Varaiya. Decidability of hybrid systems with rectangular inclusions. In Computer Aided Verification, pages 95-104, 1994.
26. Eduardo D. Sontag. Mathematical Control Theory, volume 6 of Texts in Applied Mathematics. Springer-Verlag, New-York, 2nd edition, 1998.
27. Colin Stirling. Handbook of logic in computer science, volume 2, chapter Modal and Temporal Logics, pages 477-563. Oxford University Press, 1992.
28. 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.
29. Paulo Tabuada and George J. Pappas. Finite bisimulations of controllable linear systems. Theoretical Computer Science, January 2003. Submitted, available at www.seas.upenn.edu/~tabuadap.