@inproceedings{QuaasShirmohammadiWorrell:LICS:2017,
    Author = {Quaas, K. and Shirmohammadi, M. and Worrell, J.},
    BookTitle = {Proc. of LICS'17},
    Keywords = {automata theory;computational complexity;reachability analysis;NEXPTIME-hard;TCTL;binary reachability relation;exponential-space procedure;linear arithmetic;timed automata;Automata;Integrated circuits;Difference Bound Matrices;Linear Arithmetic;Model Checking;Reachability;Timed automata},
    Month = {June},
    Pages = {1--12},
    Title = {Revisiting reachability in timed automata},
    Year = {2017},
    bdsk-url-1 = {https://dx.doi.org/10.1109/LICS.2017.8005098},
    date-added = {2017-12-07 09:47:43 +0000},
    date-modified = {2017-12-07 09:48:08 +0000},
    doi = {10.1109/LICS.2017.8005098}
}

@inproceedings{QuaasShirmohammadiWorrell:LICS:2017, Author = {Quaas, K. and Shirmohammadi, M. and Worrell, J.}, BookTitle = {Proc. of LICS'17}, Keywords = {automata theory;computational complexity;reachability analysis;NEXPTIME-hard;TCTL;binary reachability relation;exponential-space procedure;linear arithmetic;timed automata;Automata;Integrated circuits;Difference Bound Matrices;Linear Arithmetic;Model Checking;Reachability;Timed automata}, Month = {June}, Pages = {1--12}, Title = {Revisiting reachability in timed automata}, Year = {2017}, bdsk-url-1 = {https://dx.doi.org/10.1109/LICS.2017.8005098}, date-added = {2017-12-07 09:47:43 +0000}, date-modified = {2017-12-07 09:48:08 +0000}, doi = {10.1109/LICS.2017.8005098} }