Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods Sanjit A. Seshia and Randal E. Bryant Computer Science Department Carnegie.
S tate G uard A ssociation of the U nited S tates 25 November, 2009.
