Bounded model checking for timed automata

Electronic Notes in Theoretical Computer Science

Volumn 68, Issue 5, 2003, Pages 116-134

  Sorea, Maria ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLOCKS; CONSTRAINT THEORY; GRAPH THEORY; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS;

BOUNDED MODEL CHECKING (BMC); STATE-TRANSITION GRAPHS; TEMPORAL LOGIC; TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 18944388655     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80523-1     Document Type: Conference Paper

References (31)

1. Alur R., "Techniques for Automatic Verification of Real-Time Systems," Ph.D. thesis, Stanford University (1991).
2. Alur R. Timed automata. Lecture Notes in Computer Science. 1633:1999;8-22
3. Alur R., Courcoubetis C., Dill D. Model-checking for real-time systems. 5th Symp. on Logic in Computer Science (LICS 90). 1990;414-425
4. Alur R., Dill D.L. A theory of timed automata. Theoretical Computer Science. 126:1994;183-235
5. Audemard G., A. Cimatti, A. Kornilowicz and R. Sebastiani, Bounded model checking for timed systems, Proceedings of the 2nd Workshop on Real-Time Tools (RT-TOOLS'2002) (2002).
6. Barrett, C. W., D. L. Dill and A. Stump, Checking satisfiability of first-order formulas by incremental translation to SAT (2002), to be presented at CAV 2002.
7. Bryant R.E. Graph-based algorithms for boolean function Manipulation. IEEE Transactions on Computers. C-35:1986;677-691
8. Clarke E.M., Biere A., Raimi R., Zhu Y. Bounded model checking using satisfiability solving. Formal Methods in System Design. 19:2001;7-34
9. Copty, F., L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella and M. Vardi, Benefits of bounded model checking in an industrial setting, in: Computer-Aided Verification, CAV 2001, Lecture Notes in Computer Science 2101 (2001), pp. 436-453.
10. Dams, D. R., "Abstract Interpretation and Partition Refinement for Model Checking," Ph.D. thesis, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands (1996).
11. Daws C., Olivero A., Tripakis S., Yovine S. The tool KRONOS. Lecture Notes in Computer Science. 1066:1996;208-219
12. de Moura L. and H. Rueß, Lemmas on demand for satisfiability solvers, in: Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002), Cincinnati, Ohio, 2002.
13. de Moura L., H. Rueß and M. Sorea, Lazy theorem proving for bounded model checking over infinite domains, in: A. Voronkov, editor, 18th Conference on Automated Deduction (CADE), Lecture Notes in Computer Science 2392 (2002), pp. 438-455.
14. Dill D., Timing assumptions and verification of finite-state concurrent systems, in: Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407 (1989), pp. 197-212.
15. Filliǎtre J.-C., S. Owre, H. Rueß and N. Shankar, ICS: Integrated canonizer and solver, in: G. Berry, H. Comon and A. Finkel, editors, Proceedings of CAV'2001, Lecture Notes in Computer Science 2102 (2001), pp. 246-249.
16. Gerth R., Peled D., Vardi M., Wolper P. Simple on-the-fly automatic verification of linear temporal logic. Protocol Specification Testing and Verification. 1995;3-18
17. Henzinger T.A., Ho P.-H., Wong-Toi H. HYTECH: A model checker for hybrid systems. Lecture Notes in Computer Science. 1254:1997;460-463
18. Henzinger T.A., Nicollin X., Sifakis J., Yovine S. Symbolic model checking for real-time systems. Information and Computation. 111:1994;193-244
19. Kupferman O., Vardi M.Y. Model checking of safety properties. Formal Methods in System Design. 19:2001;291-314
20. Lamport L. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems. 5:1987;1-11
21. Larsen K.G., Pearson J., Weise C., Yi W. Clock difference diagrams. Nordic Journal of Computing. 6:1999;271-298
22. Larsen K.G., Pettersson P., Yi W. UPPAAL in a nutshell. Int. Journal on Software Tools for Technology Transfer. 1:1997;134-152
23. Möller J., J. Lichtenberg, H. R. Andersen and H. Hulgaard, Difference decision diagrams, in: Computer Science Logic, The IT University of Copenhagen, Denmark, 1999.
24. Möller M.O., Rueß H., Sorea M. Predicate abstraction for dense real-time systems. Asarin E., Maler O., Yovine S. Theory and Practice of Timed Systems (TPTS'02). Electronic Notes in Theoretical Computer Science. 65:2002;. URL http://www.elsevier.com/locate/entcs/volume65.html
25. Niebert P., M. Mahfoudh, E. Asarin, M. Bozga, N. Jain and O. Maler, Verification of timed automata via satisfiability checking, in: Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT), Lecture Notes in Computer Science (2002).
26. Owre S., J. M. Rushby and N. Shankar, PVS: A prototype verification system, in: 11th International Conference on Automated Deduction (CADE), Lecture Notes in Artificial Intelligence 607 (1992), pp. 748-752.
27. Penczek W., B. Wozna and A. Zbrzezny, Towards bounded model checking for the universal fragment of TCTL, in: Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT), Lecture Notes in Computer Science (2002).
28. Shostak R. Deciding linear inequalities by computing loop residues. Journal of the ACM. 28:1981;769-779
29. Sistla A.P. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing. 6:1994;495-512
30. Sorea M., Tempo: A model-checker for event-recording automata, in: Proceedings of RT-TOOLS'01, Aalborg, Denmark, 2001, also available as Technical Report SRI-CSL-01-04, Computer Science Laboratory, SRI International, Menlo Park, CA, 2001. URL http://www.csl.sri.com/papers/csl-01-04/
31. Tripakis S., Yovine S. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design. 18:2001;25-68 Kluwer Academic Publishers