File(s) stored somewhere else
Please note: Linked content is NOT stored on Carnegie Mellon University and we can't guarantee its availability, quality, security or accept any liability.
Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods
journal contributionposted on 01.01.2003, 00:00 by Sanjit A. Seshia, Randal BryantRandal Bryant
Institute for Software Research