Beyond region graphs: Symbolic forward analysis of timed automata

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

Volumn 1738, Issue , 1999, Pages 232-244

  Mukhopadhyay, Supratik ^a   Podelski, Andreas ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

BASIC CONCEPTS; FORWARD ANALYSIS; HEIDELBERG; INFINITE STATE SYSTEMS; TERMINATION CONDITION; THEORETICAL INVESTIGATIONS; TIMED AUTOMATA; VERIFICATION PROBLEMS;

AUTOMATA THEORY;

EID: 22844457378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46691-6_18     Document Type: Conference Paper

References (13)

1. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-236, 1994.
2. F. Balarin. Approximate reachability analysis of timed automata. In Proceedings of 17th IEEE Real-Time Systems Symposium, pages 52-61. IEEE Computer Society Press, 1996.
3. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Universitél de Liège, 1998.
4. C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In B. Steffen, editor, Proceedings of the fth International Conference on Tools and Algorithms for the Construction of Systems, LNCS 1384, pages 313-329. Springer-Verlag, 1998.
5. G. Delzanno and A. Podelski. Model checking in CLP. In Rance Cleaveland, editor, Proceedings of TACAS’99, the Second International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 1579 of Springer LNCS. Springer-Verlag, 1999.
6. S. Eilenberg. Automata, Languages and Machines, volume B. Academic Press, 1976.
7. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? In Proceedings of the 27th Annual Symposium on Theory of Computing, pages 373-382. ACM Press, 1995.
8. T. A. Henzinger, O. Kupferman, and S. Qadeer. From pre-historic to postmodern symbolic model checking. In Proceedings of the International Conference on Computer-Aided Verification, pages 195-206. Springer, 1998.
9. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, 1994. Special issue for LICS 92.
10. W. K. C. Lam and R. K. Brayton. Alternating RQ timed automata. In C. Courcoubetis, editor, Proceedings of the 5th International Conference on Computer-Aided Verification, LNCS 697, pages 236-252. Springer-Verlag, 1993.
11. K.G. Larsen, P. Pettersson, and W. Yi. Compositional and symbolic model checking of real-time systems. In Proceedings of the 16th Annual Real-time Systems Symposium, pages 76-87. IEEE Computer Society Press, 1995.
12. K. Marriott and P. J. Stuckey. Programming with Constraints: An Introduction. MIT Press, 1998.
13. S. Mukhopadhyay and A. Podelski. Beyond region graphs: Symbolic forward analysis of timed automata, 1999. Full Version. Available at http://www.mpi-sb.mpg.de/~podelski.