Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods

@inproceedings{Seshia2003UnboundedFS,
  title={Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods},
  author={Sanjit A. Seshia and Randal E. Bryant},
  booktitle={CAV},
  year={2003}
}
We present a new approach to unbounded, fully symbolic model checking of timed automata that is based on an efficient translation of quantified separation logic to quantified Boolean logic. Our technique preserves the interpretation of clocks over the reals and can check any property in timed computation tree logic. The core operations of eliminating quantifiers over real variables and deciding the validity of separation logic formulas are respectively translated to eliminating quantifiers on… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

Similar Papers

Loading similar papers…