I have three research areas: (a) semantics and logics for
probabilistic systems (b) logic and computation and (c)
machine learning. I work on approximation of
continuous-state systems and associated metrics and logics.
I am working on a quantitative extension of equational logic
which allows one to carry out approximate reasoning.
I have been working on Stone duality for Markov processes and
completeness theorems for Markovian logics. I am also
interested in duality for automata and using it for
minimization. Recently I have begun working on approximate
minimization. I and Alexandra Silva are organizing a workshop
Bellairs on Probabilistic Programming Languages.
Samson Abramsky, Anuj Dawar, Phokion
Kolaitis and I organized a thematic semester on
at the Simons
Institute for Theoretical Computer Science in
boards on which I serve are accessible
through Links above.