- K. Chatterjee, T. Henzinger, N. Piterman
- Computer ScienceInformation and Computation
- 3 September 2007
- K. Chatterjee, L. Doyen, T. Henzinger
- Computer ScienceTOCL
- 16 September 2008
A notion of quantitative simulation that is decidable and implies language inclusion is introduced, and it is shown that most classes of weighted automata cannot be determinized.
Energy Parity Games
- K. Chatterjee, L. Doyen
- EconomicsInternational Colloquium on Automata, Languages…
- 28 January 2010
It is shown that the problem of deciding the winner in energy parity games is logspace-equivalent to the problem in mean-payoff parity games, which can be solved in NP and an algorithm to solve energy parity by reduction to energy games is given.
Algorithms for Omega-Regular Games with Imperfect Information
- Jean-François Raskin, K. Chatterjee, L. Doyen, T. Henzinger
- Computer ScienceLog. Methods Comput. Sci.
- 25 September 2006
An algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buechi objective is given and it is shown that these algorithms are optimal by proving matching lower bounds.
Evolutionary dynamics of cancer in response to targeted combination therapy
- I. Bozic, Johannes G. Reiter, M. Nowak
- Medicine, BiologyeLife
- 20 May 2013
It is found that dual therapy results in long-term disease control for most patients, if there are no single mutations that cause cross-resistance to both drugs; in patients with large disease burden, triple therapy is needed.
Verification of Markov Decision Processes Using Learning Algorithms
- T. Brázdil, K. Chatterjee, M. Ujma
- Computer ScienceAutomated Technology for Verification and…
- 10 February 2014
A general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs) and focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations.
Model-Checking omega-Regular Properties of Interval Markov Chains
- K. Chatterjee, Koushik Sen, T. Henzinger
- Computer Science, MathematicsFoundations of Software Science and Computation…
- 29 March 2008
It is shown that the ω-PCTL model checking problem for Uncertain Markov Chain semantics is decidable in PSPACE and for Interval Markov Decision Process semantics isDecidable in coNP (improving the previous known PSPACE bound for PCTL).
Mean-payoff parity games
- K. Chatterjee, T. Henzinger, M. Jurdzinski
- Economics20th Annual IEEE Symposium on Logic in Computer…
- 26 June 2005
It is shown that optimal strategies exist in mean-payoff parity games, but they may require infinite memory.
Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
- Sheshansh Agrawal, K. Chatterjee, Petr Novotný
- Computer ScienceProc. ACM Program. Lang.
- 12 September 2017
Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The…
Better Quality in Synthesis through Quantitative Objectives
- R. Bloem, K. Chatterjee, T. Henzinger, B. Jobstmann
- Computer ScienceInternational Conference on Computer Aided…
- 16 April 2009
It is shown how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems, and how quantitative properties to measure the "goodness" of an implementation are used.