Supported by the National Natural Science Foundation of China (Grant Nos. 60203009, 60233020 and 60425204), the NSF of Jiangsu Province (Grant No. BK2003408) and the National Basic Research 973 Program of China (Grant No. 2002CB312001).
Most of the timed automata reachability analysis algorithms in the literature explore the state spaces by enumeration of symbolic states, which use time constraints to represent a set of concrete states. A time constr...