COMponent-Based Embedded Systems design Techniques

A theory of synchronous relational interfaces
S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).

The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).

Distributed, modular HTL
T.A. Henzinger, C. Kirsch, E. Marques, A. Sokolova, in:, IEEE, 2009, pp. 171–180.

Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.

Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.

Probabilistic weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 244–258.

Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational Logic (TOCL) 11 (2009).

Robustness in the presence of liveness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.

Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).

From MTL to deterministic timed automata
D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167.

Determinizing discounted-sum automata
U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.

On relational interfaces
S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, in:, EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76.

Mean-payoff automaton expressions
K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.

Quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 11 (2010).

Strategy construction for parity games with imperfect information
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.

Quantitative Simulation Games
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Z. Manna, D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli, Springer, 2010, pp. 42–60.

Alternating weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.

Expressiveness and closure properties for quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.

A survey of stochastic games with limsup and liminf objectives
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.

Stochastic games with finitary objectives
K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.

Better quality in synthesis through quantitative objectives
R. Bloem, K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009, pp. 140–156.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.

Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.

Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.

GIST: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.

Probabilistic Automata on infinite words: decidability and undecidability results
K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.

Qualitative analysis of partially-observable Markov Decision Processes
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.