Unbounded, fully symbolic model checking of timed automata using Boolean methods

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

Volumn 2725, Issue , 2003, Pages 154-166

  Seshia, Sanjit A ^a   Bryant, Randal E ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTATION THEORY; COMPUTER AIDED ANALYSIS; COMPUTER CIRCUITS; FORMAL LOGIC; MODEL CHECKING; RECONFIGURABLE HARDWARE;

BINARY DECISION DIAGRAMS (BDDS); BOOLEAN FORMULAE; BOOLEAN SATISFIABILITY; BOOLEAN VARIABLES; QUANTIFIER ELIMINATION; SEPARATION LOGIC; SYMBOLIC MODEL CHECKING; TIMED COMPUTATION TREE LOGIC;

BOOLEAN ALGEBRA;

EID: 21244432992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_16     Document Type: Article

References (18)

1. L. Aceto, P. Bouyer, A. Burgueno, and K. G. Larsen. The power of reachability testing for timed automata. Theoretical Computer Science, 300(1-3):411-475, 2003.
2. R. Alur. Timed automata. In Proc. CAV'99, LNCS 1633, pages 8-22.
3. G. Audemard, A. Cimatti, A. Korniowicz, and R. Sebastiani. Bounded model checking for timed systems. In Proc. FORTE'02, LNCS 2529, pages 243-259.
4. G. Behrmann, K. G. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient timed reachability analysis using clock difference diagrams. In Proc. CAV'99, LNCS 1633, 341-353.
5. D. Beyer. Improvements in BDD-based reachability analysis of timed automata. In Proc. FME'01, LNCS 2021, pages 318-343.
6. M. Bozga, O. Maler, A. Pnueli, and S. Yovine. Some progress in the symbolic verification of timed automata. In Proc. CAV'97, LNCS 1254, pages 179-190.
7. O. Coudert and J. C. Madre. A unified framework for the formal verification of sequential circuits. In Proc. ICCAD'90, pages 126-129.
8. G. B. Dantzig and B. C. Eaves. Fourier-Motzkin elimination and its dual. Journal of Combinatorial Theory A, 14:288-297, 1973.
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.
10. M. Koubarakis. Complexity results for first-order theories of temporal constraints. In Proc. KR'94, pages 379-390.
11. K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. CAV'02, LNCS 2404, pages 250-264.
12. J. B. Møller. Simplifying fixpoint computations in verification of real-time systems. In Proc. RTTOOLS'02 workshop.
13. P. Niebert, M. Mahfoudh, E. Asarin, M. Bozga, N. Jain, and O. Maler. Verification of timed automata via satisfiability checking. In Proc. FTRTFT'02, LNCS 2469.
14. S. A. Seshia and R. E. Bryant. A Boolean approach to unbounded, fully symbolic model checking of timed automata. Technical Report CMU-CS-03-117, Carnegie Mellon University, 2003.
15. O. Strichman. Optimizations in decision procedures for prepositional linear inequalities. Technical Report CMU-CS-02-133, Carnegie Mellon University, 2002.
16. O. Strichman, S. A. Seshia, and R. E. Bryant. Deciding separation formulas with SAT. In Proc. CAV'02, LNCS 2404, pages 209-222.
17. F. Wang. Efficient verification of timed automata with BDD-like data-structures. In Proc. VMCAI'03, LNCS 2575, pages 189-205.
18. S. Yovine. Kronos: A verification tool for real-time systems. Software Tools for Technology Transfer, 1(1/2):123-133, Oct. 1997.