Hybrid systems verification by location elimination

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

Volumn 1790, Issue , 2000, Pages 352-365

  Nonnengart, Andreas ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LOCATION;

REACHABILITY ANALYSIS; SUCCESSIVE ELIMINATION; VERIFICATION METHOD; WEAKEST PRECONDITION;

HYBRID SYSTEMS;

EID: 84974676974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46430-1_30     Document Type: Conference Paper

References (16)

1. R. Alur, C. Courcoubetis, and D. L. Dill. Model checking for real-time systems. In Proceedings of the 5th Annual Symposium on Logic in Computer Science, pages 414-425, 1990.
2. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifaksi, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
3. R. Alur, C. Courcoubetis, T. A. Henzinger, and P.-H. Ho. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, editors, Hybrid Systems, pages 209-229. Springer Verlag, Lecture Notes in Computer Science, vol. 736, 1993.
4. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
5. R. Alur and T. A. Henzinger. Logics and models of real-time: A survey. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, pages 74-106. Springer Verlag, New York, LNCS 600, 1992.
6. Rajeev Alur, Thomas A. Henzinger, and Pei-Hsin Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22(3):181-201, 1996.
7. R. Alur, T. A. Henzinger, and E. Sontag, editors. Hybrid Systems III. Lecture Notes in Computer Science, Springer Verlag, 1996.
8. P. Antsaklis, A. Nerode, W. Kohn, and S. Sastry, editors. Hybrid Systems II. Lecture Notes in Computer Science, vol. 999, Springer Verlag, 1995.
9. R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, editors. Hybrid Systems. Springer Verlag, Lecture Notes in Computer Science, vol. 736, 1993.
10. T. A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th LICS, pages 278-292. IEEE Comp. Soc. Press, 1996.
11. 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, New York, 1992.
12. Andreas Nonnengart. A deductive model checking approach for hybrid systems. Technical Report MPI-I-1999-2-006, Max-Planck-Institute for Computer Science, Saarbrücken, Germany, November 1999. Available via http://www.mpi-sb.mpg.de/.
13. Andreas Nonnengart, Hans Jürgen Ohlbach, and Andrzej Szałas. Elimination of predicate quantifiers. In Hans Jürgen Ohlbach and Uwe Reyle, editors, Logic, Language and Reasoning-Essays in Honour of Dov Gabbay. Kluwer, Dordrecht, Netherlands, 1999. ISBN: 0-7923-5687-X.
14. Andreas Nonnengart and Andrzej Szałas. A fixpoint approach to secondorder quantifier elimination with applications to correspondence theory. Technical Report MPI-I-95-2-007, Max-Planck-Institute for Computer Science, Saarbrücken, Germany, March 1995. Available via: http://www.mpisb. mpg.de/.
15. Andreas Nonnengart and Andrzej Szalas. A fixpoint approach to secondorder quantifier elimination with applications to correspondence theory. in: [Orł99], 1999.
16. Ewa Orłowska, editor. Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, volume 24 of Studies in Fuzziness and Soft Computing. Physica-Verlag, c/o Springer Verlag, 1999. ISBN: 3-7908-1164-5.