Information Processing Letters

Chen, T. and Yu, N. and Han, Tingting (2015) Continuous-time orbit problems are decidable in polynomial-time. Information Processing Letters 115 (1), pp. 11-14. ISSN 0020-0190.

Logical Methods in Computer Science

Chen, T. and Han, Tingting and Katoen, J.-P. and Mereacre, A. and Jagadeesan, R. (2011) Model checking of continuous-time Markov Chains against timed automata specifications. Logical Methods in Computer Science 7 (1), ISSN 1860-5974.