For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is defi-cient in this regard, but bounded model checking (BMC) shows some promise. However, unlike traditional model checking, for which time systems have been thoroughly researched, BMC is less capable of modeling timing behavior an essential task for verifying many types of software. Here we describe a new bounded model checker we have named xBMC, which we believe solves the reachability problem of dense-time systems. In xBMC, regions and transition relations are represented as Boolean formulae using discrete interpretations. In an experiment using well-developed model checkers to verify Fischer’s protocol, xBMC outperforms both traditional (Kronos, Uppaal, and Red) and bounded (SAL 2) model checkers by being able to verify up to 22 processes, followed by Red with 15 processes. Therefore, although xBMC is less efficient in guaranteeing the correctness of systems when compared with the other checkers, it provides an effective and practical method for timing behavior verification of large systems.