Symbolic model checking for rectangular hybrid systems

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

Volumn 1785 LNCS, Issue , 2000, Pages 142-156

  Henzinger, Thomas A ^a   Majumdar, Rupak ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; DISTRIBUTED COMPUTER SYSTEMS; HYBRID SYSTEMS; ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY);

INFINITE STATE; LTL MODEL-CHECKING; SYMBOLIC METHODS; SYMBOLIC MODEL CHECKING; TRACE EQUIVALENCE;

MODEL CHECKING;

EID: 84863944606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46419-0_11     Document Type: Conference Paper

References (32)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoreti cal 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. R. Alur and T.A. Henzinger. Real-time system = discrete system + clock variables. Software Tools for Technology Transfer, 1:86-109, 1997.
4. R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. In Proceedings of the 14th Annual Real-time Systems Symposium, pages 2-11. IEEE Computer Society Press, 1993.
5. G. Bhat and R. Cleaveland. Efficient local model-checking for fragments of the modal μ-calculus. In TACAS96: Tools and Algorithms for Construction and Analysis of Systems, LNCS 1055, pages 107-126. Springer-Verlag, 1996. (Pubitemid 126050411)
6. G. Bhat and R. Cleaveland. Efficient model checking via the equational μ-calculus. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 304-312. IEEE Computer Society Press, 1996.
7. A. Bouajjani, J.-C. Fernandez, and N. Halbwachs. Minimal model generation. In CAV 90: Computer-aided Verification, LNCS 663, pages 197-203. Springer-Verlag, 1990.
8. 20 states and beyond. Information and Computation, 98(2):142-170, 1992.
9. E.M. Clarke, O. Grumberg, and D.E. Long. Verification tools for finite-state concurrent systems. In A Decade of Concurrency: Reflections and Perspectives, LNCS 803, pages. Springer-Verlag, 1994.
10. R. Cleaveland, M. Klein, and B. Steffen. Faster model checking for the modal μ-calculus. In CAV 92: Computer-aided Verification, LNCS 663, pages 410-422. Springer-Verlag, 1993.
11. J.C. Corbett. Timing analysis of Ada tasking programs. IEEE Transactions on Software Engineering, 22:461-483, 1996. (Pubitemid 126772782)
12. * as fragments of the modal μ-calculus. Theoretical Computer Science, 126:77-96, 1994.
13. C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In TACAS98: Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1384, pages 313-329. Springer-Verlag, 1998. (Pubitemid 128055552)
14. E.A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, Volume B, pages 995-1072. Elsevier Science Publishers, 1990.
15. E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model checking for fragments of μ-calculus. In CAV 93: Computer-aided Verification, LNCS 697, pages 385-396. Springer-Verlag, 1993.
16. E.A. Emerson and C. Lei. Efficient model checking in fragments of the propositional μ-calculus. In Proceedings of the 1st Annual Symposium on Logic in Computer Science, pages 267-278. IEEE Computer Society Press, 1986. (Pubitemid 17563576)
17. T.A. Henzinger. Hybrid automata with finite bisimulations. In ICALP 95: Automata, Languages, and Programming, LNCS 944, pages 324-335. Springer-Verlag, 1995.
18. T.A. Henzinger. The theory of hybrid automata. In Proceedi ngs of the 11th Annual Symposium on Logic in Computer Science, pages 278-292. IEEE Computer Society Press, 1996.
19. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: a model checker for hybrid systems. Software Tools for Technology Transfer, 1:110-122, 1997.
20. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control, 43:540-554, 1998. (Pubitemid 128737377)
21. T.A. Henzinger, B. Horowitz, and R. Majumdar. Rectangular hybrid games. In CONCUR 99: Concurrency Theory, LNCS 1664, pages 320-335, 1999.
22. T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? Journal of Computer and System Sciences, 57:94-124, 1998. (Pubitemid 128428160)
23. T.A. Henzinger and R. Majumdar. A classification of symbolic transition systems. In STACS 2000: Theoretical Aspects of Computer Science, LNCS. Springer-Verlag, 2000.
24. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In Proceedings of the 7th Annual Symposium on Logic in Computer Science, pages 394-406. IEEE Computer Society Press, 1992. (Pubitemid 23561993)
25. T.A. Henzinger and H. Wong-Toi. Using HyTech to synthesize control parameters for a steam boiler. In Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, LNCS 1165, pages 265-282. Springer-Verlag, 1996. (Pubitemid 126154447)
26. P.-H. Ho and H. Wong-Toi. Automated analysis of an audio control protocol. In CAV 95: Computer-aided Verification, LNCS 939, pages 381-394. Springer-Verlag, 1995.
27. P.C. Kanellakis and S.A. Smolka. Ccs expressions, finite-state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
28. J. Kosecka, C.J. Tomlin, G. Pappas, and S. Sastry. Generation of conflict resolution manoeuvres for air traffic management. In IROS 97: International Conference on Intelligent Robot and Systems, Volume 3, pages 1598-1603. IEEE Press, 1997.
29. S. Nadjm-Tehrani and J.-E. Strömberg. Proving dynamic properties in an aerospace application. In Proceedings of the 16th Annual Real-time Systems Symposium, pages 2-10. IEEE Computer Society Press, 1995.
30. T. Stauner, O. Müller, and M. Fuchs. Using HyTech to verify an automotive control system. In HART 97: Hybrid and Real-time Systems, LNCS 1201, pages 139-153. Springer-Verlag, 1997. (Pubitemid 127044040)
31. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, Volume B, pages 133-191. Elsevier Science Publishers, 1990.
32. T. Villa, H. Wong-Toi, A. Balluchi, J. Preußig, A. Sangiovanni-Vincentelli, and Y. Watanabe. Formal verification of an automotive engine controller in cutoff mode. In Proceedings of the 37th Conference on Decision and Control. IEEE Press, 1998