@inbook {IOPORT.06109500,
    author       = {Herrera, Christian and Westphal, Bernd and Feo-Arenis, Sergio and Mu\~niz, Marco and Podelski, Andreas},
    title        = {Reducing quasi-equal clocks in networks of timed automata.},
    year         = {2012},
    booktitle    = {Formal modeling and analysis of timed systems. 10th international conference, FORMATS 2012, London, UK, September 18-20, 2012. Proceedings},
    isbn         = {978-3-642-33364-4},
    pages        = {155-170},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-642-33365-1_12},
    abstract     = {Summary: We introduce the novel notion of quasi-equal clocks and use it to improve the verification time of networks of timed automata. Intuitively, two clocks are quasi-equal if, during each run of the system, they have the same valuation except for those points in time where they are reset. We propose a transformation that takes a network of timed automata and yields a network of timed automata which has a smaller set of clocks and preserves properties up to those not comparing quasi-equal clocks. Our experiments demonstrate that the verification time in three transformed real world examples is much lower compared to the original.},
    identifier   = {06109500},
}