Article

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.

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.

Book Section

Chen, T. and Han, Tingting and Kammueller, F. and Nemli, I. and Probst, C.W. (2016) Model based analysis of insider threats. In: UNSPECIFIED (ed.) Cyber Security And Protection Of Digital Services (Cyber Security), 2016 International Conference On. IEEE Computer Society. ISBN 9781509007097.

Chen, T. and Han, Tingting (2014) On the complexity of computing maximum entropy for Markovian Models. In: Raman, V. and Suresh, S.P. (eds.) Proceedings, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings In Informatics 29. Wadern, Germany: Dagstuhl, pp. 571-583. ISBN 9783939897774.