Inproceedings,

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

, and .
CAV, volume 2725 of Lecture Notes in Computer Science, page 154-166. Springer, (2003)

Meta data

Tags

Users

  • @dblp

Comments and Reviews