Accurate widenings and boundedness properties of timed systems

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

Volumn 2244 LNCS, Issue , 2001, Pages 79-94

  Mukhopadhyay, Supratik ^a   Podelski, Andreas ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TIME SHARING SYSTEMS; INFORMATION SCIENCE;

BOUNDEDNESS PROPERTIES; CONSTRAINT-BASED; SYMBOLIC MODEL CHECKING; TIMED SYSTEMS; WIDENING OPERATORS;

MODEL CHECKING;

EID: 84860972015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45575-2_10     Document Type: Conference Paper

References (24)

1. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In R. Cleaveland, editor, CONCUR: Concurrency Theory, volume 630 of LNCS, pages 340-354. Springer-Verlag, 1992.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-236, 1994.
3. F. Balarin. Approximate reachability analysis of timed automata. In 17th IEEE Real-Time Systems Symposium, pages 52-61. IEEE Computer Society Press, 1996.
4. B. Boigelot, L. Bronne, and S. Rassart. An improved reachability analysis method for strongly linear hybrid systems. In O. Grumberg, editor, CAV'97: Computer Aided Verification, volume 1254 of LNCS, pages 167-178. Springer-Verlag, 1997.
5. B. Berard' and L. Fribourg. Reachability analysis of (timed) petri nets using real arithmetic. In J. C. M. Baeten and S. Mauw, editors, CONCUR: Concurrency Theory, volume 1664 of LNCS, pages 178-193. Springer-Verlag, 1999.
6. T. Bultan, R. Gerber, and W. Pugh. Symbolic model checking of infinite state systems using presburger arithmetics. In Orna Grumberg, editor, the 9th International Conference on Computer Aided Verification (CAV'97), LNCS 1254, pages 400-411. Springer, Haifa, Israel, July 1997.
7. T. Bultan, R. Gerber, and W. Pugh. Model Checking Concurrent Systems with Unbounded Integer Variables: Symbolic Representations, Approximations and Experimental Results, february 1998.
8. Johan Bengtsson, Kim. G. Larsen, Fredrik Larsson, Paul Petersson, and Wang Yi. Uppaal in 1995. In T. Margaria and B. Steffen, editors, TACAS, LNCS 1055, pages 431-434. Springer-Verlag, 1996.
9. Bernard Boigelot and Pierre Wolper. Symbolic verification with periodic sets. In David Dill, editor, 6th International Conference on Computer-Aided Verification, volume 818 of LNCS, pages 55-67. Springer-Verlag, June 1994.
10. Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In the 4th ACM Symposium on Principles of Programming Languages, 1977.
11. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In the Fifth Annual ACM Symposium on Principles of Programming Languages. ACM Press, 1978.
12. C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In Bernhard Steffen, editor, TACAS98: Tools and Algorithms for the Construction of Systems, LNCS 1384, pages 313-329. Springer-Verlag, March/April 1998.
13. N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, the International Conference on Computer-Aided-Verification, volume 697 of LNCS, pages 333-346. Springer-Verlag, 1993.
14. T. A. Henzinger and P.-H. Ho. A note on abstract-interpretation strategies for hybrid automata. In P. Antsaklis, A. Nerode, W. Kohn, and S. Sastry, editors, Hybrid Systems II, LNCS 999, pages 252-264. Springer-Verlag, 1995.
15. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: A model checker for hybrid systems. In O. Grumberg, editor, CAV97: Computer-aided Verification, LNCS 1254, pages 460-463. Springer-Verlag, 1997.
16. Thomas. A. Henzinger and Orna Kupferman. From quantity to quality. In Oded Maler, editor, Hybrid and Real-Time Systems International Workshop, Hart '97, volume 1201 of LNCS, pages 48-62, Grenoble, France, March 1997. Springer- Verlag.
17. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In the 27th Annual Symposium on Theory of Computing, pages 373-382. ACM Press, 1995.
18. T. A. Henzinger, O. Kupferman, and S. Qadeer. From pre-historic to post-modern symbolic model checking. In A. J. Hu and M. Y. Vardi, editors, CAV'98: Computeraided Verification, LNCS 1427, pages 195-206. Springer-Verlag, 1998.
19. N. Halbwachs, Y-E. Proy, and P. Romanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11(2):157-185, 1997.
20. Pei-Hsin Ho and Howard Wong-Toi. Automated analysis of an audio control protocol. In P. Wolper, editor, the Seventh Conference on Computer-Aided Verification, pages 381-394, Liege, Belgium, 1995. Springer-Verlag. LNCS 939.
21. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. The Journal of Logic Programming, 19/20:503-582, May-July 1994.
22. 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.
23. S. Mukhopadhyay and A. Podelski. Model checking for timed logic processes. In J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, and P. J. Stuckey, editors, CL: Computational Logic, LNCS, pages 598- 612. Springer, 2000. Available at http://www.mpi-sb.mpg.de/supratik/.
24. H. Wong-Toi. Symbolic Approximations for Verifying Real-Time Systems. PhD thesis, Stanford University, 1995.