Quantitative Graph Games: Theory and Applications

Project Period: 2011-12-01 – 2016-11-30
Externally Funded
Acronym
GraphGames
Principal Investigator
Krishnendu Chatterjee
Department(s)
Chatterjee Group
Description
The theory of games played on graphs provides the mathematical foundations to study numerous important problems in branches of mathematics, economics, computer science, biology, and other fields. One key application area in computer science is the formal verification of reactive systems. The system is modeled as a graph, in which vertices of the graph represent states of the system, edges represent transitions, and paths represent behavior of the system. The verification of the system in an arbitrary environment is then studied as a problem of game played on the graph, where the players represent the different interacting agents. Traditionally, these games have been studied either with Boolean objectives, or single quantitative objectives. However, for the problem of verification of systems that must behave correctly in resource-constrained environments (such as an embedded system) both Boolean and quantitative objectives are necessary: the Boolean objective for correctness specification and quantitative objective for resource-constraints. Thus we need to generalize the theory of graph games such that the objectives can express combinations of quantitative and Boolean objectives. In this project, we will focus on the following research objectives for the study of graph games with quantitative objectives: (1) develop the mathematical theory and algorithms for the new class of games on graphs obtained by combining quantitative and Boolean objectives; (2) develop practical techniques (such as compositional and abstraction techniques) that allow our algorithmic solutions be implemented efficiently to handle large game graphs; (3) explore new application areas to demonstrate the application of quantitative graph games in diverse disciplines; and (4) develop the theory of games on graphs with infinite state space and with quantitative objectives. since the theory of graph games is foundational in several disciplines, new algorithmic solutions are expected.
Grant Number
279307
Funding Organisation
FP7_ERC

164 Publications

2016 | Conference Paper | IST-REx-ID: 1245
Game-theoretic models identify useful principles for peer collaboration in online learning platforms
V. Pandey, K. Chatterjee, in:, Proceedings of the ACM Conference on Computer Supported Cooperative Work, ACM, 2016, pp. 365–368.
View | DOI
 
2016 | Conference Paper | IST-REx-ID: 1182   OA
Robust draws in balanced knockout tournaments
K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.
View | Files available | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 1194   OA
Stochastic invariants for probabilistic termination
K. Chatterjee, P. Novotny, D. Zikelic, in:, ACM, 2017, pp. 145–160.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1389   OA
On recurrent reachability for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1327   OA
Stochastic shortest path with energy constraints in POMDPs
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotny, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466.
View | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 1694
Quantitative temporal simulation and refinement distances for timed systems
K. Chatterjee, V. Prabhu, IEEE Transactions on Automatic Control 60 (2015) 2291–2306.
View | DOI
 
2014 | Conference Paper | IST-REx-ID: 2027   OA
Verification of markov decision processes using learning algorithms
T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, D. Parker, M. Ujma, in:, F. Cassez, J.-F. Raskin (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Society of Industrial and Applied Mathematics, 2014, pp. 98–114.
View | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 2034   OA
Probabilistic opacity for Markov decision processes
B. Bérard, K. Chatterjee, N. Sznajder, Information Processing Letters 115 (2015) 52–59.
View | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1839   OA
Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives
T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.
View | DOI | Download (ext.)
 
2014 | Journal Article | IST-REx-ID: 2039   OA
The time scale of evolutionary innovation
K. Chatterjee, A. Pavlogiannis, B. Adlam, M. Nowak, PLoS Computational Biology 10 (2014).
View | Files available | DOI
 
2015 | Journal Article | IST-REx-ID: 1598
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89.
View | Files available | DOI | Download (ext.)
 
2014 | Journal Article | IST-REx-ID: 1733
Interface simulation distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.
View | Files available | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 311   OA
Quantitative analysis of smart contracts
K. Chatterjee, A. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2279
Looking at mean-payoff and total-payoff through windows
K. Chatterjee, L. Doyen, M. Randour, J. Raskin, 8172 (2013) 118–132.
View | Files available | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 645   OA
Value iteration for long run average reward in markov decision processes
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 671   OA
Memory-n strategies of direct reciprocity
C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
2013 | Conference Paper | IST-REx-ID: 2820
Automated analysis of real-time scheduling using graph games
K. Chatterjee, A. Kößler, U. Schmid, in:, Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, ACM, 2013, pp. 163–172.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 25
Goal-HSVI: Heuristic search value iteration for goal-POMDPs
K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.
View | DOI
 
2016 | Journal Article | IST-REx-ID: 1529   OA
Optimal cost almost-sure reachability in POMDPs
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.
View | Files available | DOI | Download (ext.) | arXiv
 
2012 | Journal Article | IST-REx-ID: 3157
The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers
L. Diaz Jr, R. Williams, J. Wu, I. Kinde, J. Hecht, J. Berlin, B. Allen, I. Božić, J. Reiter, M. Nowak, K. Kinzler, K. Oliner, B. Vogelstein, Nature 486 (2012) 537–540.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2012 | Journal Article | IST-REx-ID: 3260
Evolutionary dynamics of biological auctions
K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2018 | Journal Article | IST-REx-ID: 157
Evolution of cooperation in stochastic games
C. Hilbe, Š. Šimsa, K. Chatterjee, M. Nowak, Nature 559 (2018) 246–249.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6175   OA
Cost analysis of nondeterministic probabilistic programs
P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019), n.d.
View | Files available | arXiv
 
2012 | Conference Paper | IST-REx-ID: 2957
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012, p. 6280437.
View | Files available | DOI | Download (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2212
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1656
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015, p. 7174926.
View | Files available | DOI | arXiv
 
2017 | Journal Article | IST-REx-ID: 467
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017) 31.
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1068   OA
Conditionally optimal algorithms for generalized Büchi Games
K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1070   OA
Computation tree logic for synchronization properties
K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1138   OA
Quantitative automata under probabilistic semantics
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1335   OA
Quantitative monitor automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Springer, 2016, pp. 23–38.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 141   OA
Symbolic algorithms for graphs and Markov decision processes with fairness objectives
K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1594
Controller synthesis for MDPs and frequency LTL\GU
V. Forejt, J. Krčál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.
View | DOI
 
2013 | Conference Paper | IST-REx-ID: 2446   OA
Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis
K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575.
View | DOI | Download (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2814   OA
The complexity of coverage
K. Chatterjee, L. Alfaro, R. Majumdar, International Journal of Foundations of Computer Science 24 (2013) 165–185.
View | DOI | Download (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2819   OA
Quantitative timed simulation functions and refinement metrics for real-time systems
K. Chatterjee, V. Prabhu, in:, Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Springer, 2013, pp. 273–282.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 297   OA
Strategy representation by decision trees in reactive synthesis
T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 2972   OA
Energy parity games
K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3254
The complexity of stochastic Müller games
K. Chatterjee, Information and Computation 211 (2012) 29–48.
View | DOI | Download (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2054
Qualitative concurrent parity games: Bounded rationality
K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 475   OA
First cycle games
B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 552   OA
Faster algorithms for mean payoff parity games
K. Chatterjee, M. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6056   OA
Probabilistic smart contracts: Secure randomness on the blockchain
K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International Conference on Blockchain and Cryptocurrency, IEEE, n.d.
View | Files available | Download (ext.) | arXiv
 
2017 | Conference Paper | IST-REx-ID: 639   OA
Non-polynomial worst case analysis of recursive programs
K. Chatterjee, H. Fu, A. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 41–63.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 716
The complexity of mean-payoff pushdown games
K. Chatterjee, Y. Velner, Journal of the ACM 64 (2017) 34.
View | DOI
 
2017 | Journal Article | IST-REx-ID: 653
Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer
A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 949   OA
JTDec: A tool for tree decompositions in soot
K. Chatterjee, A. Goharshady, A. Pavlogiannis, in:, D. D’Souza (Ed.), Springer, 2017, pp. 59–66.
View | Files available | DOI
 
2015 | Journal Article | IST-REx-ID: 1501
CEGAR for compositional analysis of qualitative properties in Markov decision processes
K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015) 230–264.
View | Files available | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 1602
Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, P. Goyal, ACM SIGPLAN Notices 50 (2015) 97–109.
View | Files available | DOI | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6380   OA
Efficient parameterized algorithms for data packing
K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019) 53.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1657
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.
View | Files available | DOI
 
2016 | Technical Report | IST-REx-ID: 5452
Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available
 
2015 | Conference Paper | IST-REx-ID: 1607
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Springer, 2015, pp. 140–157.
View | Files available | DOI | Download (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6378   OA
Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving
K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, n.d., pp. 374–381.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 2   OA
Indirect reciprocity with private noisy and incomplete information
C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, M. Nowak, PNAS 115 (2018) 12241–12246.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2012 | Conference Paper | IST-REx-ID: 3165
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1481
Automatic generation of alternative starting positions for simple traditional board games
U. Ahmed, K. Chatterjee, S. Gulwani, in:, AAAI Press, 2015, pp. 745–752.
View | Files available | Download (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2213
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.
View | Files available | DOI | Download (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2162
The complexity of ergodic mean payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
View | Files available | DOI | Download (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 1065
Pushdown reachability with constant treewidth
K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.
View | Files available | DOI
 
2014 | Journal Article | IST-REx-ID: 1375   OA
Approximating the minimum cycle mean
K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin, Theoretical Computer Science 547 (2014) 104–116.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 143   OA
Efficient algorithms for asymptotic bounds on termination time in VASS
T. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, D. Velan, F. Zuleger, in:, IEEE, 2018, pp. 185–194.
View | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1609   OA
The complexity of synthesis from probabilistic components
K. Chatterjee, L. Doyen, M. Vardi, 9135 (2015) 108–120.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 1407
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253.
View | Files available | DOI | Download (ext.)
 
2018 | Journal Article | IST-REx-ID: 198   OA
Language acquisition with communication between learners
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).
View | Files available | DOI
 
2014 | Journal Article | IST-REx-ID: 2234   OA
Markov decision processes with multiple long-run average objectives
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, Logical Methods in Computer Science 10 (2014).
View | Files available | DOI | Download (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2715   OA
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
K. Chatterjee, M. Joglekar, N. Shah, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 461–473.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 2936   OA
Finite automata with time delay blocks
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 35   OA
Algorithms and conditional lower bounds for planning problems
K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.
View | Download (ext.) | arXiv
 
2015 | Journal Article | IST-REx-ID: 1731
Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.
View | Files available | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 1856
Measuring and synthesizing systems in probabilistic environments
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015).
View | Files available | DOI | Download (ext.)
 
2012 | Conference Paper | IST-REx-ID: 496   OA
Interpretations in trees with countably many branches
A. Rabinovich, S. Rubin, in:, IEEE, 2012.
View | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 523   OA
Looking at mean-payoff and total-payoff through windows
K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.
View | Files available | DOI | Download (ext.)
 
2014 | Journal Article | IST-REx-ID: 535   OA
Polynomial time algorithms for energy games with special weight structures
K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1438
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
K. Chatterjee, H. Fu, P. Novotny, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.
View | Files available | DOI | Download (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 681   OA
Doomsday equilibria for omega-regular games
K. Chatterjee, L. Doyen, E. Filiot, J. Raskin, Information and Computation 254 (2017) 296–315.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 744
Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma
T. Priklopil, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 433 (2017) 64–72.
View | DOI
 
2015 | Conference Paper | IST-REx-ID: 1820
Optimal cost almost-sure reachability in POMDPs
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , AAAI Press, 2015, pp. 3496–3502.
View | Files available | Download (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2854   OA
Strategy improvement for concurrent reachability and turn based stochastic safety games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, Journal of Computer and System Sciences 79 (2013) 640–657.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 66   OA
Ergodic mean-payoff games for the analysis of attacks in crypto-currencies.
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 11.
View | Files available | DOI | Download (ext.) | arXiv
 
2015 | Journal Article | IST-REx-ID: 1673   OA
Amplifiers of selection
B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015) 20150114.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1661   OA
Improved algorithms for one-pair and k-pair Streett objectives
K. Chatterjee, M. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015, p. 7174888.
View | Files available | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 465
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
View | Files available | DOI
 
2015 | Journal Article | IST-REx-ID: 1604
Quantitative interprocedural analysis
K. Chatterjee, A. Pavlogiannis, Y. Velner, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT 50 (2015) 539–551.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1166
A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps
K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232.
View | Files available
 
2017 | Thesis | IST-REx-ID: 821
Algorithmic advances in program analysis and their applications
A. Pavlogiannis, Algorithmic Advances in Program Analysis and Their Applications, IST Austria, 2017.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 2955
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012, p. 6280436.
View | Files available | DOI | Download (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2063
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1069   OA
On the skolem problem for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1090   OA
Nested weighted limit-average automata of bounded width
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1386   OA
Termination analysis of probabilistic programs through Positivstellensatz's
K. Chatterjee, H. Fu, A. Goharshady, in:, Springer, 2016, pp. 3–22.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1324
Indefinite-horizon reachability in Goal-DEC-POMDPs
K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96.
View | Download (ext.)
 
2013 | Conference Paper | IST-REx-ID: 1374   OA
Infinite-state games with finitary conditions
K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1689   OA
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–268.
View | Files available | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1691
Temporal logic motion planning using POMDPs with parity objectives: Case study paper
M. Svoreňová, M. Chmelik, K. Leahy, H. Eniser, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–238.
View | DOI
 
2015 | Journal Article | IST-REx-ID: 1665
Mutations driving CLL and their evolution in progression and relapse
D. Landau, E. Tausch, A. Taylor Weiner, C. Stewart, J. Reiter, J. Bahlo, S. Kluth, I. Božić, M. Lawrence, S. Böttcher, S. Carter, K. Cibulskis, D. Mertens, C. Sougnez, M. Rosenberg, J. Hess, J. Edelmann, S. Kless, M. Kneba, M. Ritgen, A. Fink, K. Fischer, S. Gabriel, E. Lander, M. Nowak, H. Döhner, M. Hallek, D. Neuberg, G. Getz, S. Stilgenbauer, C. Wu, Nature 526 (2015) 525–530.
View | DOI
 
2014 | Journal Article | IST-REx-ID: 2187   OA
Synthesizing robust systems
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2238
Multi-objective discounted reward verification in graphs and MDPs
K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 2947   OA
Equivalence of games with probabilistic uncertainty and partial observation games
K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.
View | DOI | Download (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2916   OA
Interface Simulation Distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.
View | Files available | DOI | Download (ext.)