340 Publications

Mark all

[340]
2019 | Conference Paper | IST-REx-ID: 5948
Termination of nondeterministic probabilistic programs
H. Fu, K. Chatterjee, 11388 (2019) 468–490.
View | DOI
 
[339]
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 | Download (ext.) | arXiv
 
[338]
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
 
[337]
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
 
[336]
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:, ACM, n.d.
View | Files available
 
[335]
2019 | Conference Paper | IST-REx-ID: 6462   OA
Run-time optimization for learned controllers through quantitative games
G. Avni, R. Bloem, K. Chatterjee, T.A. Henzinger, B. Konighofer, S. Pranger, in:, 31st International Conference on Computer-Aided Verification, Springer, n.d.
View | Files available
 
[334]
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.)
 
[333]
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
 
[332]
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
 
[331]
2018 | Book Chapter | IST-REx-ID: 59
Graph games and reactive synthesis
R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Modeling Checking, 1st ed., Springer, 2018, pp. 921–962.
View | DOI
 
[330]
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
 
[329]
2018 | Conference Paper | IST-REx-ID: 310   OA
Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter
K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, ACM, 2018, pp. 2341–2356.
View | DOI | Download (ext.) | arXiv
 
[328]
2018 | Journal Article | IST-REx-ID: 454   OA
Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness
J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, M. Nowak, Nature Communications 9 (2018).
View | Files available | DOI
 
[327]
2018 | Journal Article | IST-REx-ID: 5993
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).
View | Files available | DOI
 
[326]
2018 | Journal Article | IST-REx-ID: 6009   OA
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).
View | Files available | DOI | Download (ext.) | arXiv
 
[325]
2018 | Book Chapter | IST-REx-ID: 86
Computing average response time
K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.
View | DOI
 
[324]
2018 | Conference Paper | IST-REx-ID: 79   OA
Parameter-independent strategies for pMDPs via POMDPs
S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70.
View | DOI | Download (ext.) | arXiv
 
[323]
2018 | Journal Article | IST-REx-ID: 738   OA
Automated competitive analysis of real time scheduling with graph games
K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207.
View | Files available | DOI
 
[322]
2018 | Conference Paper | IST-REx-ID: 24   OA
Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives
K. Chatterjee, A. Elgyütt, P. Novotny, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.
View | DOI | Download (ext.) | arXiv
 
[321]
2018 | Conference Paper | IST-REx-ID: 6340   OA
Secure Credit Reporting on the Blockchain
A.K. Goharshady, A. Behrouz, K. Chatterjee, in:, Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–1348.
View | Files available | arXiv
 
[320]
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
 
[319]
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
 
[318]
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
 
[317]
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
 
[316]
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
 
[315]
2018 | Journal Article | IST-REx-ID: 2
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 | PubMed | Europe PMC
 
[314]
2018 | Conference Paper | IST-REx-ID: 325   OA View | DOI | Download (ext.) | arXiv
 
[313]
2018 | Conference Paper | IST-REx-ID: 34   OA
Sensor synthesis for POMDPs with reachability objectives
K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55.
View | Download (ext.) | arXiv
 
[312]
2018 | Conference Paper | IST-REx-ID: 5679   OA
New approaches for almost-sure termination of probabilistic programs
M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.
View | DOI | Download (ext.) | arXiv
 
[311]
2018 | Journal Article | IST-REx-ID: 419
Partners and rivals in direct reciprocity
C. Hilbe, K. Chatterjee, M. Nowak, Nature Human Behaviour 2 (2018) 469–477.
View | Files available | DOI
 
[310]
2018 | Preprint | IST-REx-ID: 5977   OA
Computational Approaches for Stochastic Shortest Path on Succinct MDPs
K. Chatterjee, H. Fu, A. Goharshady, N. Okati, ArXiv (n.d.).
View | Download (ext.) | arXiv
 
[309]
2018 | Journal Article | IST-REx-ID: 5751
Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018) 71.
View | Files available | DOI
 
[308]
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
 
[307]
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.)
 
[306]
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.)
 
[305]
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
 
[304]
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
 
[303]
2017 | Conference Paper | IST-REx-ID: 1009   OA
Optimizing expectation with guarantees in POMDPs
K. Chatterjee, P. Novotny, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp. 3725–3732.
View | Download (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 1011   OA
Faster algorithms for weighted recursive state machines
K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.
View | DOI | Download (ext.)
 
[301]
2017 | Journal Article | IST-REx-ID: 1080   OA
Reconstructing metastatic seeding patterns of human cancers
J. Reiter, A. Makohon Moore, J. Gerold, I. Božić, K. Chatterjee, C. Iacobuzio Donahue, B. Vogelstein, M. Nowak, Nature Communications 8 (2017).
View | Files available | DOI
 
[300]
2017 | Journal Article | IST-REx-ID: 1294
Trading performance for stability in Markov decision processes
T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, Journal of Computer and System Sciences 84 (2017) 144–170.
View | Files available | DOI
 
[299]
2017 | Book Chapter | IST-REx-ID: 625
The cost of exactness in quantitative reachability
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.
View | DOI
 
[298]
2017 | Journal Article | IST-REx-ID: 719
Special issue: Synthesis and SYNT 2014
K. Chatterjee, R. Ehlers, Acta Informatica 54 (2017) 543–544.
View | DOI
 
[297]
2017 | Technical Report | IST-REx-ID: 5455   OA
Optimal Dyck reachability for data-dependence and alias analysis
K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.
View | Files available
 
[296]
2017 | Journal Article | IST-REx-ID: 466
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017) 15.
View | Files available | DOI
 
[295]
2017 | Journal Article | IST-REx-ID: 512
Amplification on undirected population structures: Comets beat stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).
View | Files available | DOI
 
[294]
2017 | Journal Article | IST-REx-ID: 1066
Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation 254 (2017) 143–166.
View | Files available | DOI
 
[293]
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.)
 
[292]
2017 | Conference Paper | IST-REx-ID: 551   OA
Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 
[291]
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.)
 
[290]
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
 
[289]
2017 | Technical Report | IST-REx-ID: 5456   OA
Data-centric Dynamic Partial Order Reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.
View | Files available
 
[288]
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
 
[287]
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
 
[286]
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.)
 
[285]
2017 | Journal Article | IST-REx-ID: 684   OA
Obligation blackwell games and p-automata
K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.
View | DOI | Download (ext.)
 
[284]
2017 | Conference Paper | IST-REx-ID: 711   OA
Bidirectional nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 
[283]
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
 
[282]
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
 
[281]
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
 
[280]
2017 | Conference Paper | IST-REx-ID: 553   OA
Strategy complexity of concurrent safety games
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI | Download (ext.)
 
[279]
2017 | Conference Paper | IST-REx-ID: 628   OA
Automated recurrence analysis for almost linear expected runtime bounds
K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139.
View | DOI | Download (ext.)
 
[278]
2017 | Journal Article | IST-REx-ID: 717   OA
Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259.
View | Files available | DOI | Download (ext.)
 
[277]
2017 | Journal Article | IST-REx-ID: 464
Improved algorithms for parity and Streett objectives
K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).
View | Files available | DOI
 
[276]
2017 | Research Data | IST-REx-ID: 5559
Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , Strong Amplifiers of Natural Selection, IST Austria, 2017.
View | Files available | DOI
 
[275]
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
 
[274]
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
 
[273]
2016 | Conference Paper | IST-REx-ID: 478   OA
The complexity of deciding legality of a single step of magic: The gathering
K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
View | Files available | DOI
 
[272]
2016 | Conference Paper | IST-REx-ID: 480   OA
Perfect-information stochastic games with generalized mean-payoff objectives
K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.
View | DOI | Download (ext.)
 
[271]
2016 | Journal Article | IST-REx-ID: 1477   OA
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.
View | Files available | DOI | Download (ext.) | arXiv
 
[270]
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
 
[269]
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.)
 
[268]
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.)
 
[267]
2016 | Technical Report | IST-REx-ID: 5451   OA
Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available
 
[266]
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
 
[265]
2016 | Technical Report | IST-REx-ID: 5449   OA
Amplification on Undirected Population Structures: Comets Beat Stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.
View | Files available
 
[264]
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
 
[263]
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
 
[262]
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.)
 
[261]
2016 | Conference Paper | IST-REx-ID: 1140   OA
Model and objective separation with conditional lower bounds disjunction is harder than conjunction
K. Chatterjee, W. Dvoák, M. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.
View | DOI | Download (ext.)
 
[260]
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.)
 
[259]
2016 | Technical Report | IST-REx-ID: 5445   OA
Quantitative interprocedural analysis
K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.
View | Files available
 
[258]
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
 
[257]
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
 
[256]
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.)
 
[255]
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.)
 
[254]
2016 | Conference Paper | IST-REx-ID: 1071
Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
View | Files available | DOI
 
[253]
2016 | Conference Paper | IST-REx-ID: 1437
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.
View | Files available | DOI | Download (ext.)
 
[252]
2016 | Technical Report | IST-REx-ID: 5453   OA
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
 
[251]
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.)
 
[250]
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.)
 
[249]
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.)
 
[248]
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.)
 
[247]
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
 
[246]
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
 
[245]
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.)
 
[244]
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
 
[243]
2015 | Technical Report | IST-REx-ID: 5430
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available
 
[242]
2015 | Technical Report | IST-REx-ID: 5435
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available
 
[241]
2015 | Journal Article | IST-REx-ID: 1559   OA
Computational complexity of ecological and evolutionary spatial dynamics
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[240]
2015 | Journal Article | IST-REx-ID: 1624   OA
Cellular cooperation with shift updating and repulsion
A. Pavlogiannis, K. Chatterjee, B. Adlam, M. Nowak, Scientific Reports 5 (2015).
View | Files available | DOI
 
[239]
2015 | Journal Article | IST-REx-ID: 1698   OA
The complexity of multi-mean-payoff and multi-energy games
Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.
View | DOI | Download (ext.)
 
[238]
2015 | Journal Article | IST-REx-ID: 1681   OA
Evolution of decisions in population games with sequentially searching individuals
T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437.
View | Files available | DOI
 
[237]
2015 | Conference Paper | IST-REx-ID: 1838   OA
Assume-guarantee synthesis for concurrent reactive programs with partial information
R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp. 517–532.
View | DOI | Download (ext.)
 
[236]
2015 | Technical Report | IST-REx-ID: 5429   OA
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available
 
[235]
2015 | Technical Report | IST-REx-ID: 5443   OA
A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
View | Files available
 
[234]
2015 | Technical Report | IST-REx-ID: 5431   OA
The patience of concurrent stochastic games with safety and reachability objectives
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
View | Files available
 
[233]
2015 | Technical Report | IST-REx-ID: 5436   OA
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.
View | Files available
 
[232]
2015 | Conference Paper | IST-REx-ID: 1732   OA
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 
[231]
2015 | Journal Article | IST-REx-ID: 524   OA
Qualitative analysis of concurrent mean payoff games
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
View | Files available | DOI | Download (ext.) | arXiv
 
[230]
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
 
[229]
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.)
 
[228]
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.)
 
[227]
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.)
 
[226]
2015 | Technical Report | IST-REx-ID: 5444   OA
Reconstructing robust phylogenies of metastatic cancers
J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.
View | Files available
 
[225]
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
 
[224]
2015 | Technical Report | IST-REx-ID: 5437   OA
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available
 
[223]
2015 | Conference Paper | IST-REx-ID: 1714
A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, in:, Real-Time Systems Symposium, IEEE, 2015, pp. 118–127.
View | Files available | DOI
 
[222]
2015 | Technical Report | IST-REx-ID: 5432
The Complexity of Evolutionary Games on Graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
View | Files available
 
[221]
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.)
 
[220]
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
 
[219]
2015 | Journal Article | IST-REx-ID: 1873   OA
POMDPs under probabilistic semantics
K. Chatterjee, M. Chmelik, Artificial Intelligence 221 (2015) 46–72.
View | DOI | Download (ext.) | arXiv
 
[218]
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.)
 
[217]
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
 
[216]
2015 | Technical Report | IST-REx-ID: 5440
The Complexity of Evolutionary Games on Graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
View | Files available
 
[215]
2015 | Technical Report | IST-REx-ID: 5438   OA
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.
View | Files available
 
[214]
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.)
 
[213]
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.)
 
[212]
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
 
[211]
2015 | Journal Article | IST-REx-ID: 1709
Biological auctions with multiple rewards
J. Reiter, A. Kanodia, R. Gupta, M. Nowak, K. Chatterjee, Proceedings of the Royal Society of London Series B Biological Sciences 282 (2015).
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[210]
2015 | Conference Paper | IST-REx-ID: 1603
Counterexample explanation by learning small strategies in Markov decision processes
T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, pp. 158–177.
View | Files available | DOI | Download (ext.)
 
[209]
2015 | Technical Report | IST-REx-ID: 5441   OA
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
K. Chatterjee, R. Ibsen-Jensen, A. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.
View | Files available
 
[208]
2015 | Conference Paper | IST-REx-ID: 1610
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, 9135 (2015) 121–133.
View | Files available | DOI
 
[207]
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.)
 
[206]
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.)
 
[205]
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.)
 
[204]
2014 | Technical Report | IST-REx-ID: 5428   OA
Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.
View | Files available
 
[203]
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
 
[202]
2014 | Technical Report | IST-REx-ID: 5423
A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014.
View | Files available
 
[201]
2014 | Journal Article | IST-REx-ID: 2716   OA
Strategy synthesis for multi-dimensional quantitative objectives
K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.
View | DOI | Download (ext.)
 
[200]
2014 | Journal Article | IST-REx-ID: 2141 View | Files available | DOI | Download (ext.)
 
[199]
2014 | Technical Report | IST-REx-ID: 5424
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
View | Files available
 
[198]
2014 | Conference Paper | IST-REx-ID: 2216
Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
View | Files available | DOI | Download (ext.)
 
[197]
2014 | Technical Report | IST-REx-ID: 5412
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
View | Files available
 
[196]
2014 | Journal Article | IST-REx-ID: 2038   OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014) 27.
View | Files available | DOI
 
[195]
2014 | Journal Article | IST-REx-ID: 2211
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15 (2014) 16.
View | Files available | DOI | Download (ext.) | arXiv
 
[194]
2014 | Conference Paper | IST-REx-ID: 1903
Partial-observation stochastic reachability and parity games
K. Chatterjee, in:, Springer, 2014, pp. 1–4.
View | Files available | DOI
 
[193]
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.)
 
[192]
2014 | Conference Paper | IST-REx-ID: 1853
Game theoretic secure localization in wireless sensor networks
S. Jha, S. Tripakis, S. Seshia, K. Chatterjee, in:, IEEE, 2014, pp. 85–90.
View | DOI
 
[191]
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
 
[190]
2014 | Technical Report | IST-REx-ID: 5413
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
View | Files available
 
[189]
2014 | Technical Report | IST-REx-ID: 5420   OA
The value 1 problem for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
View | Files available
 
[188]
2014 | Technical Report | IST-REx-ID: 5418   OA
Games with a weak adversary
K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.
View | Files available
 
[187]
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
 
[186]
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
 
[185]
2014 | Technical Report | IST-REx-ID: 5426
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
View | Files available
 
[184]
2014 | Technical Report | IST-REx-ID: 5421   OA
The complexity of evolution on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
View | Files available
 
[183]
2014 | Technical Report | IST-REx-ID: 5419   OA
Improved algorithms for reachability and shortest path on low tree-width graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
View | Files available
 
[182]
2014 | Conference Paper | IST-REx-ID: 2213   OA
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
 
[181]
2014 | Conference Paper | IST-REx-ID: 2162   OA
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
 
[180]
2014 | Technical Report | IST-REx-ID: 5414   OA
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
View | Files available
 
[179]
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
 
[178]
2014 | Conference Paper | IST-REx-ID: 2163
Games with a weak adversary
K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.
View | Files available | DOI | Download (ext.) | arXiv
 
[177]
2014 | Technical Report | IST-REx-ID: 5427   OA
Optimal tree-decomposition balancing and reachability on low treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
View | Files available
 
[176]
2014 | Technical Report | IST-REx-ID: 5415
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.
View | Files available
 
[175]
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
 
[174]
2013 | Journal Article | IST-REx-ID: 2816
Evolutionary dynamics of cancer in response to targeted combination therapy
I. Božić, J. Reiter, B. Allen, T. Antal, K. Chatterjee, P. Shah, Y. Moon, A. Yaqubie, N. Kelly, D. Le, E. Lipson, P. Chapman, L. Diaz, B. Vogelstein, M. Nowak, ELife 2 (2013).
View | Files available | DOI
 
[173]
2013 | Technical Report | IST-REx-ID: 5409   OA
Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
View | Files available
 
[172]
2013 | Technical Report | IST-REx-ID: 5404
The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
View | Files available
 
[171]
2013 | Conference (Editor) | IST-REx-ID: 2292
Mathematical Foundations of Computer Science 2013
K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.
View | DOI
 
[170]
2013 | Conference Paper | IST-REx-ID: 2444   OA
Faster algorithms for Markov decision processes with low treewidth
K. Chatterjee, J. Ła̧Cki, 8044 (2013) 543–558.
View | DOI | Download (ext.) | arXiv
 
[169]
2013 | Conference Paper | IST-REx-ID: 2305   OA
Trading performance for stability in Markov decision processes
T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, in:, 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–340.
View | Files available | DOI | Download (ext.) | arXiv
 
[168]
2013 | Journal Article | IST-REx-ID: 2824
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
K. Chatterjee, V. Prabhu, Information and Computation 228–229 (2013) 83–119.
View | DOI
 
[167]
2013 | Journal Article | IST-REx-ID: 2831   OA
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M. Henzinger, M. Joglekar, N. Shah, Formal Methods in System Design 42 (2013) 301–327.
View | DOI | Download (ext.) | arXiv
 
[166]
2013 | Journal Article | IST-REx-ID: 2836   OA
Assume-guarantee synthesis for digital contract signing
K. Chatterjee, V. Raman, Formal Aspects of Computing 26 (2013) 825–859.
View | DOI | Download (ext.) | arXiv
 
[165]
2013 | Journal Article | IST-REx-ID: 2817   OA
Density games
S. Novak, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 334 (2013) 26–34.
View | Files available | DOI
 
[164]
2013 | Conference Paper | IST-REx-ID: 2329
Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, 8052 (2013) 500–515.
View | Files available | DOI | Download (ext.) | arXiv
 
[163]
2013 | Journal Article | IST-REx-ID: 2247
Forgiver triumphs in alternating prisoner's dilemma
B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).
View | Files available | DOI
 
[162]
2013 | Conference Paper | IST-REx-ID: 1376
Distributed synthesis for LTL fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.
View | Files available | DOI
 
[161]
2013 | Technical Report | IST-REx-ID: 5405
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.
View | Files available
 
[160]
2013 | Technical Report | IST-REx-ID: 5400
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, T. Mathieu, What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.
View | Files available
 
[159]
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.)
 
[158]
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
 
[157]
2013 | Technical Report | IST-REx-ID: 5406   OA
Distributed synthesis for LTL Fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.
View | Files available
 
[156]
2013 | Journal Article | IST-REx-ID: 2299   OA
Synthesis of AMBA AHB from formal specification: A case study
Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.
View | Files available | DOI
 
[155]
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
 
[154]
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
 
[153]
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.)
 
[152]
2013 | Technical Report | IST-REx-ID: 5399   OA
TTP: Tool for Tumor Progression
J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression, IST Austria, 2013.
View | Files available
 
[151]
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
 
[150]
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
 
[149]
2013 | Journal Article | IST-REx-ID: 3116
Code aware resource management
K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods in System Design 42 (2013) 142–174.
View | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 2858
The effect of one additional driver mutation on tumor progression
J. Reiter, I. Božić, B. Allen, K. Chatterjee, M. Nowak, Evolutionary Applications 6 (2013) 34–45.
View | Files available | DOI
 
[147]
2013 | Technical Report | IST-REx-ID: 5403
Qualitative analysis of concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
View | Files available
 
[146]
2013 | Technical Report | IST-REx-ID: 5410   OA
Automatic generation of alternative starting positions for traditional board games
U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.
View | Files available
 
[145]
2013 | Technical Report | IST-REx-ID: 5408
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
View | Files available
 
[144]
2013 | Conference Paper | IST-REx-ID: 2295 View | Files available | DOI
 
[143]
2013 | Conference Paper | IST-REx-ID: 2000
TTP: Tool for tumor progression
J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int. Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.
View | Files available | DOI | Download (ext.) | arXiv
 
[142]
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
 
[141]
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.)
 
[140]
2012 | Journal Article | IST-REx-ID: 3314
Discounting and averaging in games across time scales
K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.
View | DOI
 
[139]
2012 | Conference Paper | IST-REx-ID: 2955   OA
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
 
[138]
2012 | Technical Report | IST-REx-ID: 5377   OA
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
View | Files available
 
[137]
2012 | Journal Article | IST-REx-ID: 2848   OA
Evolutionary game dynamics in populations with different learners
K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[136]
2012 | Conference Paper | IST-REx-ID: 3252   OA
Synthesizing protocols for digital contract signing
K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.
View | DOI | Download (ext.)
 
[135]
2012 | Journal Article | IST-REx-ID: 3846   OA
A survey of stochastic ω regular games
K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.
View | Files available | DOI
 
[134]
2012 | Technical Report | IST-REx-ID: 5397   OA
The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, The Decidability Frontier for Probabilistic Automata on Infinite Words, IST Austria, 2012.
View | Files available
 
[133]
2012 | Conference Paper | IST-REx-ID: 497
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.
View | Files available | DOI
 
[132]
2012 | Conference Paper | IST-REx-ID: 2956
Mean payoff pushdown games
K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
View | Files available | DOI
 
[131]
2012 | Conference Paper | IST-REx-ID: 3341   OA
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, in:, Springer, 2012, pp. 270–285.
View | Files available | DOI | Download (ext.) | arXiv
 
[130]
2012 | Technical Report | IST-REx-ID: 5378   OA
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
View | Files available
 
[129]
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
 
[128]
2012 | Conference Paper | IST-REx-ID: 2957   OA
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
 
[127]
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
 
[126]
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.)
 
[125]
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
 
[124]
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.)
 
[123]
2012 | Conference Paper | IST-REx-ID: 3135   OA
Efficient controller synthesis for consumption games with multiple resource types
B. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, in:, Springer, 2012, pp. 23–38.
View | DOI | Download (ext.)
 
[122]
2012 | Journal Article | IST-REx-ID: 3128   OA
A survey of partial-observation stochastic parity games
K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284.
View | Files available | DOI
 
[121]
2012 | Conference Paper | IST-REx-ID: 3255
Games and Markov decision processes with mean payoff parity and energy parity objectives
K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.
View | DOI
 
[120]
2011 | Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View | DOI
 
[119]
2011 | Conference Paper | IST-REx-ID: 3345   OA
Energy and mean-payoff parity Markov Decision Processes
K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.
View | Files available | DOI | Download (ext.) | arXiv
 
[118]
2011 | Journal Article | IST-REx-ID: 3338
Bounded rationality in concurrent parity games
K. Chatterjee, CoRR: Computing Research Repository (2011) 1–51.
View | Files available | Download (ext.) | arXiv
 
[117]
2011 | Technical Report | IST-REx-ID: 5384
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.
View | Files available
 
[116]
2011 | Conference Paper | IST-REx-ID: 3365   OA
QUASY: quantitative synthesis tool
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.
View | Files available | DOI
 
[115]
2011 | Journal Article | IST-REx-ID: 3339   OA
Magnifying lens abstraction for stochastic games with discounted and long-run average objectives
K. Chatterjee, L. De Alfaro, R. Pritam, CoRR: Computing Research Repository (2011).
View | Download (ext.) | arXiv
 
[114]
2011 | Conference Paper | IST-REx-ID: 3346   OA
Two views on multiple mean payoff objectives in Markov Decision Processes
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.
View | DOI | Download (ext.)
 
[113]
2011 | Journal Article | IST-REx-ID: 3315
Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).
View | Files available | DOI
 
[112]
2011 | Technical Report | IST-REx-ID: 5380   OA
Bounded rationality in concurrent parity games
K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.
View | Files available
 
[111]
2011 | Technical Report | IST-REx-ID: 5385
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.
View | Files available
 
[110]
2011 | Conference Paper | IST-REx-ID: 3316
Specification-centered robustness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, IEEE, 2011, pp. 176–185.
View | DOI
 
[109]
2011 | Conference Paper | IST-REx-ID: 3347   OA
Finitary languages
K. Chatterjee, N. Fijalkow, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 216–226.
View | DOI | Download (ext.)
 
[108]
2011 | Conference Paper | IST-REx-ID: 3361   OA
The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
View | Files available | DOI
 
[107]
2011 | Conference Paper | IST-REx-ID: 3342   OA
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.
View | DOI | Download (ext.) | arXiv
 
[106]
2011 | Journal Article | IST-REx-ID: 3354
Qualitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).
View | Files available | DOI
 
[105]
2011 | Technical Report | IST-REx-ID: 5381
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.
View | Files available
 
[104]
2011 | Technical Report | IST-REx-ID: 5379   OA
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.
View | Files available
 
[103]
2011 | Conference Paper | IST-REx-ID: 3366
Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.
View | Files available | DOI
 
[102]
2011 | Conference Paper | IST-REx-ID: 3348   OA
Synthesis of memory efficient real time controllers for safety objectives
K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230.
View | DOI | Download (ext.)
 
[101]
2011 | Conference Paper | IST-REx-ID: 3350
Minimum attention controller synthesis for omega regular objectives
K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159.
View | DOI
 
[100]
2011 | Conference Paper | IST-REx-ID: 3343   OA View | DOI | Download (ext.)
 
[99]
2011 | Technical Report | IST-REx-ID: 5382
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.
View | Files available
 
[98]
2011 | Technical Report | IST-REx-ID: 5387
Energy and mean-payoff parity Markov decision processes
K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, IST Austria, 2011.
View | Files available
 
[97]
2011 | Conference Paper | IST-REx-ID: 3349   OA
A reduction from parity games to simple stochastic games
K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86.
View | DOI | Download (ext.)
 
[96]
2011 | Conference Paper | IST-REx-ID: 3351   OA
On memoryless quantitative objectives
K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159.
View | DOI | Download (ext.)
 
[95]
2011 | Conference Paper | IST-REx-ID: 3344
Graph games with reachability objectives
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.
View | DOI
 
[94]
2011 | Report | IST-REx-ID: 3363   OA
The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, The Decidability Frontier for Probabilistic Automata on Infinite Words, ArXiv, n.d.
View | Download (ext.)
 
[93]
2011 | Conference Paper | IST-REx-ID: 3356
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3864   OA
Measuring and synthesizing systems in probabilistic environments
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.
View | Files available | DOI | Download (ext.)
 
[91]
2010 | Conference Paper | IST-REx-ID: 3852   OA
Discounting in games across time scales
K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29.
View | Files available | DOI | Download (ext.) | arXiv
 
[90]
2010 | Conference Paper | IST-REx-ID: 3857
Probabilistic Automata on infinite words: decidability and undecidability results
K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3865
Analyzing the impact of change in multi-threaded programs
K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 293–307.
View | DOI
 
[88]
2010 | Conference Paper | IST-REx-ID: 3860   OA
Generalized mean-payoff and energy games
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.
View | Files available | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3853   OA
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.
View | Files available | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3858
The complexity of partial-observation parity games
K. Chatterjee, L. Doyen, in:, C. Fermüller, A. Voronkov (Eds.), Springer, 2010, pp. 1–14.
View | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3866   OA
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.
View | Files available | DOI
 
[84]
2010 | Conference Paper | IST-REx-ID: 3854
Obliging games
K. Chatterjee, F. Horn, C. Löding, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–296.
View | DOI
 
[83]
2010 | Conference (Editor) | IST-REx-ID: 3859
FORMATS: Formal modeling and analysis of timed systems
K. Chatterjee, T.A. Henzinger, eds., FORMATS: Formal Modeling and Analysis of Timed Systems, Springer, 2010.
View | DOI
 
[82]
2010 | Journal Article | IST-REx-ID: 3861
Strategy logic
K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.
View | Files available | DOI
 
[81]
2010 | Conference Paper | IST-REx-ID: 4388   OA
GIST: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.
View | Files available | DOI | Download (ext.) | arXiv
 
[80]
2010 | Journal Article | IST-REx-ID: 3862   OA
Quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 11 (2010) 23.
View | Files available | DOI
 
[79]
2010 | Journal Article | IST-REx-ID: 3867
Expressiveness and closure properties for quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.
View | Files available | DOI
 
[78]
2010 | Conference Paper | IST-REx-ID: 3855
Qualitative analysis of partially-observable Markov Decision Processes
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.
View | Files available | DOI
 
[77]
2010 | Conference Paper | IST-REx-ID: 3856   OA
Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.
View | Files available | DOI | Download (ext.)
 
[76]
2010 | Conference Paper | IST-REx-ID: 3851   OA
Energy parity games
K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 599–610.
View | DOI | Download (ext.) | arXiv
 
[75]
2010 | Journal Article | IST-REx-ID: 3863
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.
View | Files available | DOI
 
[74]
2010 | Journal Article | IST-REx-ID: 3868
Algorithms for game metrics
K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer Science 6 (2010) 1–27.
View | Files available | DOI
 
[73]
2010 | Technical Report | IST-REx-ID: 5388   OA
Quantitative synthesis for concurrent programs
K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.
View | Files available
 
[72]
2010 | Technical Report | IST-REx-ID: 5390   OA
Topological, automata-theoretic and logical characterization of finitary languages
K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization of Finitary Languages, IST Austria, 2010.
View | Files available
 
[71]
2009 | Conference Paper | IST-REx-ID: 3871   OA
Probabilistic weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 244–258.
View | Files available | DOI
 
[70]
2009 | Conference Paper | IST-REx-ID: 4545   OA
A survey of stochastic games with limsup and liminf objectives
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.
View | Files available | DOI
 
[69]
2009 | Conference Paper | IST-REx-ID: 4569   OA
Better quality in synthesis through quantitative objectives
R. Bloem, K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009, pp. 140–156.
View | DOI | Download (ext.) | arXiv
 
[68]
2009 | Journal Article | IST-REx-ID: 3869
Qualitative logics and equivalences for probabilistic systems
K. Chatterjee, L. De Alfaro, M. Faella, A. Legay, Logical Methods in Computer Science 5 (2009).
View | DOI
 
[67]
2009 | Conference Paper | IST-REx-ID: 4540
Expressiveness and closure properties for quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, IEEE, 2009, pp. 199–208.
View | Files available | DOI
 
[66]
2009 | Technical Report | IST-REx-ID: 5392   OA
Probabilistic automata on infinite words: Decidability and undecidability results
K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and Undecidability Results, IST Austria, 2009.
View | Files available
 
[65]
2009 | Conference Paper | IST-REx-ID: 4542   OA
Alternating weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.
View | Files available | DOI
 
[64]
2009 | Conference Paper | IST-REx-ID: 4580   OA
Alpaga: A tool for solving parity games with imperfect information
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 58–61.
View | Files available | DOI | Download (ext.)
 
[63]
2009 | Technical Report | IST-REx-ID: 5393
Gist: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.
View | Files available
 
[62]
2009 | Conference Paper | IST-REx-ID: 4543
Stochastic games with finitary objectives
K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.
View | DOI
 
[61]
2009 | Technical Report | IST-REx-ID: 5394   OA
Improved lower bounds for request-response and finitary Streett games
K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.
View | Files available
 
[60]
2009 | Journal Article | IST-REx-ID: 3870   OA
Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational Logic (TOCL) 11 (2009).
View | Files available | DOI
 
[59]
2009 | Conference Paper | IST-REx-ID: 3503   OA
Probabilistic systems with limsup and liminf objectives
K. Chatterjee, T.A. Henzinger, in:, Springer, 2009, pp. 32–45.
View | DOI | Download (ext.)
 
[58]
2009 | Conference Paper | IST-REx-ID: 4544   OA
Termination criteria for solving concurrent safety and reachability games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2009, pp. 197–206.
View | Files available | DOI | Download (ext.)
 
[57]
2009 | Technical Report | IST-REx-ID: 5395   OA
Qualitative analysis of partially-observable Markov decision processes
K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.
View | Files available
 
[56]
2008 | Conference Paper | IST-REx-ID: 3876
Timed parity games: complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 124–140.
View | Files available | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3504   OA
Algorithms for game metrics
K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 107–118.
View | Files available | DOI
 
[54]
2008 | Book Chapter | IST-REx-ID: 3872
Value iteration
K. Chatterjee, T.A. Henzinger, in:, 25 Years in Model Checking, Springer, 2008, pp. 107–138.
View | DOI
 
[53]
2008 | Conference Paper | IST-REx-ID: 3877
Environment assumptions for synthesis
K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 147–161.
View | DOI
 
[52]
2008 | Conference Paper | IST-REx-ID: 4546
Logical reliability of interacting real-time tasks
K. Chatterjee, A. Ghosal, T.A. Henzinger, D. Iercan, C. Kirsch, C. Pinello, A. Sangiovanni Vincentelli, in:, IEEE, 2008, pp. 909–914.
View | DOI | Download (ext.)
 
[51]
2008 | Journal Article | IST-REx-ID: 4534
Reduction of stochastic parity to stochastic mean-payoff games
K. Chatterjee, T.A. Henzinger, Information Processing Letters 106 (2008) 1–7.
View | DOI | Download (ext.)
 
[50]
2008 | Conference Paper | IST-REx-ID: 3501
Assigning trust to Wikipedia content
B.T. Adler, K. Chatterjee, L. De Alfaro, M. Faella, I. Pye, V. Raman, in:, ACM, 2008.
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3873
Controller synthesis with budget constraints
K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2008, pp. 72–86.
View | DOI
 
[48]
2008 | Conference Paper | IST-REx-ID: 3878   OA
The complexity of coverage
K. Chatterjee, L. De Alfaro, R. Majumdar, in:, Springer, 2008, pp. 91–106.
View | DOI | Download (ext.)
 
[47]
2008 | Conference Paper | IST-REx-ID: 3880
Strategy construction for parity games with imperfect information
D. Berwanger, K. Chatterjee, L. Doyen, T.A. Henzinger, S. Raje, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 325–339.
View | Files available | DOI
 
[46]
2008 | Conference Paper | IST-REx-ID: 3502
Robust content-driven reputation
K. Chatterjee, L. De Alfaro, I. Pye, in:, ACM, 2008, pp. 33–42.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3874
Trading infinite memory for uniform randomness in timed games
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 87–100.
View | DOI
 
[44]
2008 | Conference Paper | IST-REx-ID: 3879
Quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2008, pp. 385–400.
View | DOI
 
[43]
2008 | Journal Article | IST-REx-ID: 4548
Stochastic limit-average games are in EXPTIME
K. Chatterjee, R. Majumdar, T.A. Henzinger, International Journal of Game Theory 37 (2008) 219–234.
View | DOI | Download (ext.)
 
[42]
2008 | Conference Paper | IST-REx-ID: 3875
Model-checking omega-regular properties of interval Markov chains
K. Chatterjee, T.A. Henzinger, K. Sen, in:, Springer, 2008, pp. 302–317.
View | DOI
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Generalized parity games
K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Springer, 2007, pp. 153–167.
View | DOI
 
[40]
2007 | Conference Paper | IST-REx-ID: 3884
Strategy logic
K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 59–73.
View | Files available | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3885
Optimal strategy synthesis in stochastic Müller games
K. Chatterjee, in:, Springer, 2007, pp. 138–152.
View | DOI
 
[38]
2007 | Journal Article | IST-REx-ID: 4547
Algorithms for omega-regular games with imperfect information
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, Logical Methods in Computer Science 3 (2007) 1–23.
View | DOI
 
[37]
2007 | Thesis | IST-REx-ID: 4559
Stochastic ω-Regular Games
K. Chatterjee, Stochastic ω-Regular Games, University of California, Berkeley, 2007.
View | Download (ext.)
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Stochastic Müller games are PSPACE-complete
K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 436–448.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3881
Qualitative logics and equivalences for probabilistic systems
L. De Alfaro, K. Chatterjee, M. Faella, A. Legay, in:, IEEE, 2007, pp. 237–248.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 3887
Markov decision processes with multiple long-run average objectives
K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 473–484.
View | DOI
 
[33]
2007 | Conference Paper | IST-REx-ID: 4537
Assume-guarantee synthesis
K. Chatterjee, T.A. Henzinger, in:, Springer, 2007, pp. 261–275.
View | DOI
 
[32]
2007 | Journal Article | IST-REx-ID: 3882
Concurrent games with tail objectives
K. Chatterjee, Theoretical Computer Science 388 (2007) 181–198.
View | DOI
 
[31]
2006 | Conference Paper | IST-REx-ID: 3888
Strategy improvement for stochastic Rabin and Streett games
K. Chatterjee, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2006, pp. 375–389.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3890
The complexity of quantitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2006, pp. 678–687.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 4552
Strategy improvement for concurrent reachability games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, IEEE, 2006, pp. 291–300.
View | DOI
 
[28]
2006 | Conference Paper | IST-REx-ID: 4538
Strategy improvement and randomized subexponential algorithms for stochastic parity games
K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 512–523.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3889
Algorithms for omega-regular games with imperfect information
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Springer, 2006, pp. 287–302.
View | DOI
 
[26]
2006 | Conference Paper | IST-REx-ID: 3891
Concurrent games with tail objectives
K. Chatterjee, in:, Springer, 2006, pp. 256–270.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3500
Algorithms for Büchi Games
K. Chatterjee, T.A. Henzinger, N. Piterman, in:, ACM, 2006.
View | Download (ext.)
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 257–271.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 3449
Games for controls
K. Chatterjee, R. Jagadeesan, C. Pitcher, in:, IEEE, 2006, pp. 70–82.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 3499
Nash equilibrium for upward-closed objectives
K. Chatterjee, in:, Springer, 2006, pp. 271–286.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Games with secure equilibria
K. Chatterjee, T.A. Henzinger, M. Jurdziński, Theoretical Computer Science 365 (2006) 67–82.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Compositional quantitative reasoning
K. Chatterjee, L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:, IEEE, 2006, pp. 179–188.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4551
Markov decision processes with multiple objectives
K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2006, pp. 325–336.
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 4557
Counterexample-guided planning
K. Chatterjee, T.A. Henzinger, R. Jhala, R. Majumdar, in:, AUAI Press, 2005, pp. 104–111.
View | Download (ext.)
 
[17]
2005 | Conference Paper | IST-REx-ID: 3896
Complexity of compositional model checking of computation tree logic on simple structures
K. Chatterjee, P. Dasgupta, P. Chakrabarti, in:, Springer, 2005, pp. 89–102.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 4541
Semiperfect-information games
K. Chatterjee, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005, pp. 1–18.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4553
The complexity of stochastic Rabin and Streett games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, Springer, 2005, pp. 878–890.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4560
Verifying quantitative properties using bound functions
A. Chakrabarti, K. Chatterjee, T.A. Henzinger, O. Kupferman, R. Majumdar, in:, Springer, 2005, pp. 50–64.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 3892
Games with secure equilibria
K. Chatterjee, T.A. Henzinger, M. Jurdziński, in:, Springer, 2005, pp. 141–161.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4554
Mean-payoff parity games
K. Chatterjee, T.A. Henzinger, M. Jurdziński, in:, IEEE, 2005, pp. 178–187.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3893
Two-player nonzero-sum ω-regular games
K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005, pp. 413–427.
View | DOI
 
[10]
2004 | Conference Paper | IST-REx-ID: 3895
Games with secure equilibria
K. Chatterjee, T.A. Henzinger, M. Jurdziński, in:, IEEE, 2004, pp. 160–169.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 4558
Quantitative stochastic parity games
K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, SIAM, 2004, pp. 121–130.
View
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Trading memory for randomness
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, IEEE, 2004, pp. 206–217.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 3894
On Nash equilibria in stochastic games
K. Chatterjee, R. Majumdar, M. Jurdziński, in:, Springer, 2004, pp. 26–40.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Stack size analysis for interrupt-driven programs
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, Information and Computation 194 (2004) 144–174.
View | DOI
 
[5]
2003 | Journal Article | IST-REx-ID: 3593
A branching time temporal framework for quantitative reasoning
K. Chatterjee, P. Dasgupta, P. Chakrabarti, Journal of Automated Reasoning 30 (2003) 205–232.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3897
Simple stochastic parity games
K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, Springer, 2003, pp. 100–113.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3898
Stack size analysis for interrupt-driven programs
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, in:, Springer, 2003, pp. 109–126.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Implementation of shape grammar for plan analysis
S. Mallick, K. Chatterjee, A. Merchant, P. Dasgupta, in:, Elsevier, 2002.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Weighted quantified computation tree logic
K. Chatterjee, P. Dasgupta, P. Chakrabarti, in:, Elsevier, 2001.
View
 

Search

Filter Publications

Display / Sort

Export / Embed

340 Publications

Mark all

[340]
2019 | Conference Paper | IST-REx-ID: 5948
Termination of nondeterministic probabilistic programs
H. Fu, K. Chatterjee, 11388 (2019) 468–490.
View | DOI
 
[339]
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 | Download (ext.) | arXiv
 
[338]
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
 
[337]
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
 
[336]
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:, ACM, n.d.
View | Files available
 
[335]
2019 | Conference Paper | IST-REx-ID: 6462   OA
Run-time optimization for learned controllers through quantitative games
G. Avni, R. Bloem, K. Chatterjee, T.A. Henzinger, B. Konighofer, S. Pranger, in:, 31st International Conference on Computer-Aided Verification, Springer, n.d.
View | Files available
 
[334]
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.)
 
[333]
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
 
[332]
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
 
[331]
2018 | Book Chapter | IST-REx-ID: 59
Graph games and reactive synthesis
R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Modeling Checking, 1st ed., Springer, 2018, pp. 921–962.
View | DOI
 
[330]
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
 
[329]
2018 | Conference Paper | IST-REx-ID: 310   OA
Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter
K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, ACM, 2018, pp. 2341–2356.
View | DOI | Download (ext.) | arXiv
 
[328]
2018 | Journal Article | IST-REx-ID: 454   OA
Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness
J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, M. Nowak, Nature Communications 9 (2018).
View | Files available | DOI
 
[327]
2018 | Journal Article | IST-REx-ID: 5993
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).
View | Files available | DOI
 
[326]
2018 | Journal Article | IST-REx-ID: 6009   OA
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).
View | Files available | DOI | Download (ext.) | arXiv
 
[325]
2018 | Book Chapter | IST-REx-ID: 86
Computing average response time
K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.
View | DOI
 
[324]
2018 | Conference Paper | IST-REx-ID: 79   OA
Parameter-independent strategies for pMDPs via POMDPs
S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70.
View | DOI | Download (ext.) | arXiv
 
[323]
2018 | Journal Article | IST-REx-ID: 738   OA
Automated competitive analysis of real time scheduling with graph games
K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207.
View | Files available | DOI
 
[322]
2018 | Conference Paper | IST-REx-ID: 24   OA
Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives
K. Chatterjee, A. Elgyütt, P. Novotny, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.
View | DOI | Download (ext.) | arXiv
 
[321]
2018 | Conference Paper | IST-REx-ID: 6340   OA
Secure Credit Reporting on the Blockchain
A.K. Goharshady, A. Behrouz, K. Chatterjee, in:, Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–1348.
View | Files available | arXiv
 
[320]
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
 
[319]
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
 
[318]
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
 
[317]
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
 
[316]
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
 
[315]
2018 | Journal Article | IST-REx-ID: 2
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 | PubMed | Europe PMC
 
[314]
2018 | Conference Paper | IST-REx-ID: 325   OA View | DOI | Download (ext.) | arXiv
 
[313]
2018 | Conference Paper | IST-REx-ID: 34   OA
Sensor synthesis for POMDPs with reachability objectives
K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55.
View | Download (ext.) | arXiv
 
[312]
2018 | Conference Paper | IST-REx-ID: 5679   OA
New approaches for almost-sure termination of probabilistic programs
M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.
View | DOI | Download (ext.) | arXiv
 
[311]
2018 | Journal Article | IST-REx-ID: 419
Partners and rivals in direct reciprocity
C. Hilbe, K. Chatterjee, M. Nowak, Nature Human Behaviour 2 (2018) 469–477.
View | Files available | DOI
 
[310]
2018 | Preprint | IST-REx-ID: 5977   OA
Computational Approaches for Stochastic Shortest Path on Succinct MDPs
K. Chatterjee, H. Fu, A. Goharshady, N. Okati, ArXiv (n.d.).
View | Download (ext.) | arXiv
 
[309]
2018 | Journal Article | IST-REx-ID: 5751
Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018) 71.
View | Files available | DOI
 
[308]
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
 
[307]
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.)
 
[306]
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.)
 
[305]
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
 
[304]
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
 
[303]
2017 | Conference Paper | IST-REx-ID: 1009   OA
Optimizing expectation with guarantees in POMDPs
K. Chatterjee, P. Novotny, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp. 3725–3732.
View | Download (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 1011   OA
Faster algorithms for weighted recursive state machines
K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.
View | DOI | Download (ext.)
 
[301]
2017 | Journal Article | IST-REx-ID: 1080   OA
Reconstructing metastatic seeding patterns of human cancers
J. Reiter, A. Makohon Moore, J. Gerold, I. Božić, K. Chatterjee, C. Iacobuzio Donahue, B. Vogelstein, M. Nowak, Nature Communications 8 (2017).
View | Files available | DOI
 
[300]
2017 | Journal Article | IST-REx-ID: 1294
Trading performance for stability in Markov decision processes
T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, Journal of Computer and System Sciences 84 (2017) 144–170.
View | Files available | DOI
 
[299]
2017 | Book Chapter | IST-REx-ID: 625
The cost of exactness in quantitative reachability
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.
View | DOI
 
[298]
2017 | Journal Article | IST-REx-ID: 719
Special issue: Synthesis and SYNT 2014
K. Chatterjee, R. Ehlers, Acta Informatica 54 (2017) 543–544.
View | DOI
 
[297]
2017 | Technical Report | IST-REx-ID: 5455   OA
Optimal Dyck reachability for data-dependence and alias analysis
K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.
View | Files available
 
[296]
2017 | Journal Article | IST-REx-ID: 466
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017) 15.
View | Files available | DOI
 
[295]
2017 | Journal Article | IST-REx-ID: 512
Amplification on undirected population structures: Comets beat stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).
View | Files available | DOI
 
[294]
2017 | Journal Article | IST-REx-ID: 1066
Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation 254 (2017) 143–166.
View | Files available | DOI
 
[293]
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.)
 
[292]
2017 | Conference Paper | IST-REx-ID: 551   OA
Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 
[291]
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.)
 
[290]
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
 
[289]
2017 | Technical Report | IST-REx-ID: 5456   OA
Data-centric Dynamic Partial Order Reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.
View | Files available
 
[288]
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
 
[287]
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
 
[286]
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.)
 
[285]
2017 | Journal Article | IST-REx-ID: 684   OA
Obligation blackwell games and p-automata
K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.
View | DOI | Download (ext.)
 
[284]
2017 | Conference Paper | IST-REx-ID: 711   OA
Bidirectional nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 
[283]
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
 
[282]
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
 
[281]
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
 
[280]
2017 | Conference Paper | IST-REx-ID: 553   OA
Strategy complexity of concurrent safety games
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI | Download (ext.)
 
[279]
2017 | Conference Paper | IST-REx-ID: 628   OA
Automated recurrence analysis for almost linear expected runtime bounds
K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139.
View | DOI | Download (ext.)
 
[278]
2017 | Journal Article | IST-REx-ID: 717   OA
Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259.
View | Files available | DOI | Download (ext.)
 
[277]
2017 | Journal Article | IST-REx-ID: 464
Improved algorithms for parity and Streett objectives
K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).
View | Files available | DOI
 
[276]
2017 | Research Data | IST-REx-ID: 5559
Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , Strong Amplifiers of Natural Selection, IST Austria, 2017.
View | Files available | DOI
 
[275]
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
 
[274]
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
 
[273]
2016 | Conference Paper | IST-REx-ID: 478   OA
The complexity of deciding legality of a single step of magic: The gathering
K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
View | Files available | DOI
 
[272]
2016 | Conference Paper | IST-REx-ID: 480   OA
Perfect-information stochastic games with generalized mean-payoff objectives
K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.
View | DOI | Download (ext.)
 
[271]
2016 | Journal Article | IST-REx-ID: 1477   OA
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.
View | Files available | DOI | Download (ext.) | arXiv
 
[270]
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
 
[269]
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.)
 
[268]
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.)
 
[267]
2016 | Technical Report | IST-REx-ID: 5451   OA
Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available
 
[266]
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
 
[265]
2016 | Technical Report | IST-REx-ID: 5449   OA
Amplification on Undirected Population Structures: Comets Beat Stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.
View | Files available
 
[264]
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
 
[263]
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
 
[262]
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.)
 
[261]
2016 | Conference Paper | IST-REx-ID: 1140   OA
Model and objective separation with conditional lower bounds disjunction is harder than conjunction
K. Chatterjee, W. Dvoák, M. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.
View | DOI | Download (ext.)
 
[260]
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.)
 
[259]
2016 | Technical Report | IST-REx-ID: 5445   OA
Quantitative interprocedural analysis
K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.
View | Files available
 
[258]
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
 
[257]
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
 
[256]
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.)
 
[255]
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.)
 
[254]
2016 | Conference Paper | IST-REx-ID: 1071
Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
View | Files available | DOI
 
[253]
2016 | Conference Paper | IST-REx-ID: 1437
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.
View | Files available | DOI | Download (ext.)
 
[252]
2016 | Technical Report | IST-REx-ID: 5453   OA
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
 
[251]
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.)
 
[250]
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.)
 
[249]
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.)
 
[248]
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.)
 
[247]
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
 
[246]
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
 
[245]
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.)
 
[244]
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
 
[243]
2015 | Technical Report | IST-REx-ID: 5430
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available
 
[242]
2015 | Technical Report | IST-REx-ID: 5435
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available
 
[241]
2015 | Journal Article | IST-REx-ID: 1559   OA
Computational complexity of ecological and evolutionary spatial dynamics
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[240]
2015 | Journal Article | IST-REx-ID: 1624   OA
Cellular cooperation with shift updating and repulsion
A. Pavlogiannis, K. Chatterjee, B. Adlam, M. Nowak, Scientific Reports 5 (2015).
View | Files available | DOI
 
[239]
2015 | Journal Article | IST-REx-ID: 1698   OA
The complexity of multi-mean-payoff and multi-energy games
Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.
View | DOI | Download (ext.)
 
[238]
2015 | Journal Article | IST-REx-ID: 1681   OA
Evolution of decisions in population games with sequentially searching individuals
T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437.
View | Files available | DOI
 
[237]
2015 | Conference Paper | IST-REx-ID: 1838   OA
Assume-guarantee synthesis for concurrent reactive programs with partial information
R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp. 517–532.
View | DOI | Download (ext.)
 
[236]
2015 | Technical Report | IST-REx-ID: 5429   OA
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available
 
[235]
2015 | Technical Report | IST-REx-ID: 5443   OA
A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
View | Files available
 
[234]
2015 | Technical Report | IST-REx-ID: 5431   OA
The patience of concurrent stochastic games with safety and reachability objectives
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
View | Files available
 
[233]
2015 | Technical Report | IST-REx-ID: 5436   OA
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.
View | Files available
 
[232]
2015 | Conference Paper | IST-REx-ID: 1732   OA
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 
[231]
2015 | Journal Article | IST-REx-ID: 524   OA
Qualitative analysis of concurrent mean payoff games
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
View | Files available | DOI | Download (ext.) | arXiv
 
[230]
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
 
[229]
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.)
 
[228]
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.)
 
[227]
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.)
 
[226]
2015 | Technical Report | IST-REx-ID: 5444   OA
Reconstructing robust phylogenies of metastatic cancers
J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.
View | Files available
 
[225]
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
 
[224]
2015 | Technical Report | IST-REx-ID: 5437   OA
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available
 
[223]
2015 | Conference Paper | IST-REx-ID: 1714
A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, in:, Real-Time Systems Symposium, IEEE, 2015, pp. 118–127.
View | Files available | DOI
 
[222]
2015 | Technical Report | IST-REx-ID: 5432
The Complexity of Evolutionary Games on Graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
View | Files available
 
[221]
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.)
 
[220]
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
 
[219]
2015 | Journal Article | IST-REx-ID: 1873   OA
POMDPs under probabilistic semantics
K. Chatterjee, M. Chmelik, Artificial Intelligence 221 (2015) 46–72.
View | DOI | Download (ext.) | arXiv
 
[218]
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.)
 
[217]
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
 
[216]
2015 | Technical Report | IST-REx-ID: 5440
The Complexity of Evolutionary Games on Graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
View | Files available
 
[215]
2015 | Technical Report | IST-REx-ID: 5438   OA
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.
View | Files available
 
[214]
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.)
 
[213]
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.)
 
[212]
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
 
[211]
2015 | Journal Article | IST-REx-ID: 1709
Biological auctions with multiple rewards
J. Reiter, A. Kanodia, R. Gupta, M. Nowak, K. Chatterjee, Proceedings of the Royal Society of London Series B Biological Sciences 282 (2015).
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[210]
2015 | Conference Paper | IST-REx-ID: 1603
Counterexample explanation by learning small strategies in Markov decision processes
T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, pp. 158–177.
View | Files available | DOI | Download (ext.)
 
[209]
2015 | Technical Report | IST-REx-ID: 5441   OA
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
K. Chatterjee, R. Ibsen-Jensen, A. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.
View | Files available
 
[208]
2015 | Conference Paper | IST-REx-ID: 1610
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, 9135 (2015) 121–133.
View | Files available | DOI
 
[207]
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.)
 
[206]
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.)
 
[205]
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.)
 
[204]
2014 | Technical Report | IST-REx-ID: 5428   OA
Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.
View | Files available
 
[203]
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
 
[202]
2014 | Technical Report | IST-REx-ID: 5423
A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014.
View | Files available
 
[201]
2014 | Journal Article | IST-REx-ID: 2716   OA
Strategy synthesis for multi-dimensional quantitative objectives
K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.
View | DOI | Download (ext.)
 
[200]
2014 | Journal Article | IST-REx-ID: 2141 View | Files available | DOI | Download (ext.)
 
[199]
2014 | Technical Report | IST-REx-ID: 5424
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
View | Files available
 
[198]
2014 | Conference Paper | IST-REx-ID: 2216
Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
View | Files available | DOI | Download (ext.)
 
[197]
2014 | Technical Report | IST-REx-ID: 5412
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
View | Files available
 
[196]
2014 | Journal Article | IST-REx-ID: 2038   OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014) 27.
View | Files available | DOI
 
[195]
2014 | Journal Article | IST-REx-ID: 2211
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15 (2014) 16.
View | Files available | DOI | Download (ext.) | arXiv
 
[194]
2014 | Conference Paper | IST-REx-ID: 1903
Partial-observation stochastic reachability and parity games
K. Chatterjee, in:, Springer, 2014, pp. 1–4.
View | Files available | DOI
 
[193]
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.)
 
[192]
2014 | Conference Paper | IST-REx-ID: 1853
Game theoretic secure localization in wireless sensor networks
S. Jha, S. Tripakis, S. Seshia, K. Chatterjee, in:, IEEE, 2014, pp. 85–90.
View | DOI
 
[191]
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
 
[190]
2014 | Technical Report | IST-REx-ID: 5413
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
View | Files available
 
[189]
2014 | Technical Report | IST-REx-ID: 5420   OA
The value 1 problem for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
View | Files available
 
[188]
2014 | Technical Report | IST-REx-ID: 5418   OA
Games with a weak adversary
K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.
View | Files available
 
[187]
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
 
[186]
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
 
[185]
2014 | Technical Report | IST-REx-ID: 5426
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
View | Files available
 
[184]
2014 | Technical Report | IST-REx-ID: 5421   OA
The complexity of evolution on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
View | Files available
 
[183]
2014 | Technical Report | IST-REx-ID: 5419   OA
Improved algorithms for reachability and shortest path on low tree-width graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
View | Files available
 
[182]
2014 | Conference Paper | IST-REx-ID: 2213   OA
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
 
[181]
2014 | Conference Paper | IST-REx-ID: 2162   OA
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
 
[180]
2014 | Technical Report | IST-REx-ID: 5414   OA
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
View | Files available
 
[179]
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
 
[178]
2014 | Conference Paper | IST-REx-ID: 2163
Games with a weak adversary
K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.
View | Files available | DOI | Download (ext.) | arXiv
 
[177]
2014 | Technical Report | IST-REx-ID: 5427   OA
Optimal tree-decomposition balancing and reachability on low treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
View | Files available
 
[176]
2014 | Technical Report | IST-REx-ID: 5415
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.
View | Files available
 
[175]
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
 
[174]
2013 | Journal Article | IST-REx-ID: 2816
Evolutionary dynamics of cancer in response to targeted combination therapy
I. Božić, J. Reiter, B. Allen, T. Antal, K. Chatterjee, P. Shah, Y. Moon, A. Yaqubie, N. Kelly, D. Le, E. Lipson, P. Chapman, L. Diaz, B. Vogelstein, M. Nowak, ELife 2 (2013).
View | Files available | DOI
 
[173]
2013 | Technical Report | IST-REx-ID: 5409   OA
Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
View | Files available
 
[172]
2013 | Technical Report | IST-REx-ID: 5404
The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
View | Files available
 
[171]
2013 | Conference (Editor) | IST-REx-ID: 2292
Mathematical Foundations of Computer Science 2013
K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.
View | DOI
 
[170]
2013 | Conference Paper | IST-REx-ID: 2444   OA
Faster algorithms for Markov decision processes with low treewidth
K. Chatterjee, J. Ła̧Cki, 8044 (2013) 543–558.
View | DOI | Download (ext.) | arXiv
 
[169]
2013 | Conference Paper | IST-REx-ID: 2305   OA
Trading performance for stability in Markov decision processes
T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, in:, 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–340.
View | Files available | DOI | Download (ext.) | arXiv
 
[168]
2013 | Journal Article | IST-REx-ID: 2824
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
K. Chatterjee, V. Prabhu, Information and Computation 228–229 (2013) 83–119.
View | DOI
 
[167]
2013 | Journal Article | IST-REx-ID: 2831   OA
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M. Henzinger, M. Joglekar, N. Shah, Formal Methods in System Design 42 (2013) 301–327.
View | DOI | Download (ext.) | arXiv
 
[166]
2013 | Journal Article | IST-REx-ID: 2836   OA
Assume-guarantee synthesis for digital contract signing
K. Chatterjee, V. Raman, Formal Aspects of Computing 26 (2013) 825–859.
View | DOI | Download (ext.) | arXiv
 
[165]
2013 | Journal Article | IST-REx-ID: 2817   OA
Density games
S. Novak, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 334 (2013) 26–34.
View | Files available | DOI
 
[164]
2013 | Conference Paper | IST-REx-ID: 2329
Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, 8052 (2013) 500–515.
View | Files available | DOI | Download (ext.) | arXiv
 
[163]
2013 | Journal Article | IST-REx-ID: 2247
Forgiver triumphs in alternating prisoner's dilemma
B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).
View | Files available | DOI
 
[162]
2013 | Conference Paper | IST-REx-ID: 1376
Distributed synthesis for LTL fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.
View | Files available | DOI
 
[161]
2013 | Technical Report | IST-REx-ID: 5405
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.
View | Files available
 
[160]
2013 | Technical Report | IST-REx-ID: 5400
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, T. Mathieu, What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.
View | Files available
 
[159]
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.)
 
[158]
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
 
[157]
2013 | Technical Report | IST-REx-ID: 5406   OA
Distributed synthesis for LTL Fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.
View | Files available
 
[156]
2013 | Journal Article | IST-REx-ID: 2299   OA
Synthesis of AMBA AHB from formal specification: A case study
Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.
View | Files available | DOI
 
[155]
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
 
[154]
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
 
[153]
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.)
 
[152]
2013 | Technical Report | IST-REx-ID: 5399   OA
TTP: Tool for Tumor Progression
J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression, IST Austria, 2013.
View | Files available
 
[151]
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
 
[150]
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
 
[149]
2013 | Journal Article | IST-REx-ID: 3116
Code aware resource management
K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods in System Design 42 (2013) 142–174.
View | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 2858
The effect of one additional driver mutation on tumor progression
J. Reiter, I. Božić, B. Allen, K. Chatterjee, M. Nowak, Evolutionary Applications 6 (2013) 34–45.
View | Files available | DOI
 
[147]
2013 | Technical Report | IST-REx-ID: 5403
Qualitative analysis of concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
View | Files available
 
[146]
2013 | Technical Report | IST-REx-ID: 5410   OA
Automatic generation of alternative starting positions for traditional board games
U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.
View | Files available
 
[145]
2013 | Technical Report | IST-REx-ID: 5408
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
View | Files available
 
[144]
2013 | Conference Paper | IST-REx-ID: 2295 View | Files available | DOI
 
[143]
2013 | Conference Paper | IST-REx-ID: 2000
TTP: Tool for tumor progression
J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int. Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.
View | Files available | DOI | Download (ext.) | arXiv
 
[142]
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
 
[141]
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.)
 
[140]
2012 | Journal Article | IST-REx-ID: 3314
Discounting and averaging in games across time scales
K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.
View | DOI
 
[139]
2012 | Conference Paper | IST-REx-ID: 2955   OA
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
 
[138]
2012 | Technical Report | IST-REx-ID: 5377   OA
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
View | Files available
 
[137]
2012 | Journal Article | IST-REx-ID: 2848   OA
Evolutionary game dynamics in populations with different learners
K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[136]
2012 | Conference Paper | IST-REx-ID: 3252   OA
Synthesizing protocols for digital contract signing
K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.
View | DOI | Download (ext.)
 
[135]
2012 | Journal Article | IST-REx-ID: 3846   OA
A survey of stochastic ω regular games
K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.
View | Files available | DOI
 
[134]
2012 | Technical Report | IST-REx-ID: 5397   OA
The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, The Decidability Frontier for Probabilistic Automata on Infinite Words, IST Austria, 2012.
View | Files available
 
[133]
2012 | Conference Paper | IST-REx-ID: 497
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.
View | Files available | DOI
 
[132]
2012 | Conference Paper | IST-REx-ID: 2956
Mean payoff pushdown games
K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
View | Files available | DOI
 
[131]
2012 | Conference Paper | IST-REx-ID: 3341   OA
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, in:, Springer, 2012, pp. 270–285.
View | Files available | DOI | Download (ext.) | arXiv
 
[130]
2012 | Technical Report | IST-REx-ID: 5378   OA
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
View | Files available
 
[129]
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
 
[128]
2012 | Conference Paper | IST-REx-ID: 2957   OA
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
 
[127]
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
 
[126]
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.)
 
[125]
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
 
[124]
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.)
 
[123]
2012 | Conference Paper | IST-REx-ID: 3135   OA
Efficient controller synthesis for consumption games with multiple resource types
B. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, in:, Springer, 2012, pp. 23–38.
View | DOI | Download (ext.)
 
[122]
2012 | Journal Article | IST-REx-ID: 3128   OA
A survey of partial-observation stochastic parity games
K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284.
View | Files available | DOI
 
[121]
2012 | Conference Paper | IST-REx-ID: 3255
Games and Markov decision processes with mean payoff parity and energy parity objectives
K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.
View | DOI
 
[120]
2011 | Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View | DOI
 
[119]
2011 | Conference Paper | IST-REx-ID: 3345   OA
Energy and mean-payoff parity Markov Decision Processes
K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.
View | Files available | DOI | Download (ext.) | arXiv
 
[118]
2011 | Journal Article | IST-REx-ID: 3338
Bounded rationality in concurrent parity games
K. Chatterjee, CoRR: Computing Research Repository (2011) 1–51.
View | Files available | Download (ext.) | arXiv
 
[117]
2011 | Technical Report | IST-REx-ID: 5384
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.
View | Files available
 
[116]
2011 | Conference Paper | IST-REx-ID: 3365   OA
QUASY: quantitative synthesis tool
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.
View | Files available | DOI
 
[115]
2011 | Journal Article | IST-REx-ID: 3339   OA
Magnifying lens abstraction for stochastic games with discounted and long-run average objectives
K. Chatterjee, L. De Alfaro, R. Pritam, CoRR: Computing Research Repository (2011).
View | Download (ext.) | arXiv
 
[114]
2011 | Conference Paper | IST-REx-ID: 3346   OA
Two views on multiple mean payoff objectives in Markov Decision Processes
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.
View | DOI | Download (ext.)
 
[113]
2011 | Journal Article | IST-REx-ID: 3315
Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).
View | Files available | DOI
 
[112]
2011 | Technical Report | IST-REx-ID: 5380   OA
Bounded rationality in concurrent parity games
K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.
View | Files available
 
[111]
2011 | Technical Report | IST-REx-ID: 5385
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.
View | Files available
 
[110]
2011 | Conference Paper | IST-REx-ID: 3316
Specification-centered robustness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, IEEE, 2011, pp. 176–185.
View | DOI
 
[109]
2011 | Conference Paper | IST-REx-ID: 3347   OA
Finitary languages
K. Chatterjee, N. Fijalkow, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 216–226.
View | DOI | Download (ext.)
 
[108]
2011 | Conference Paper | IST-REx-ID: 3361   OA
The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
View | Files available | DOI
 
[107]
2011 | Conference Paper | IST-REx-ID: 3342   OA
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.
View | DOI | Download (ext.) | arXiv
 
[106]
2011 | Journal Article | IST-REx-ID: 3354
Qualitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).
View | Files available | DOI
 
[105]
2011 | Technical Report | IST-REx-ID: 5381
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.
View | Files available
 
[104]
2011 | Technical Report | IST-REx-ID: 5379   OA
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.
View | Files available
 
[103]
2011 | Conference Paper | IST-REx-ID: 3366
Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.
View | Files available | DOI
 
[102]
2011 | Conference Paper | IST-REx-ID: 3348   OA
Synthesis of memory efficient real time controllers for safety objectives
K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230.
View | DOI | Download (ext.)
 
[101]
2011 | Conference Paper | IST-REx-ID: 3350
Minimum attention controller synthesis for omega regular objectives
K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159.
View | DOI
 
[100]
2011 | Conference Paper | IST-REx-ID: 3343   OA View | DOI | Download (ext.)
 
[99]
2011 | Technical Report | IST-REx-ID: 5382
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.
View | Files available
 
[98]
2011 | Technical Report | IST-REx-ID: 5387
Energy and mean-payoff parity Markov decision processes
K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, IST Austria, 2011.
View | Files available
 
[97]
2011 | Conference Paper | IST-REx-ID: 3349   OA
A reduction from parity games to simple stochastic games
K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86.
View | DOI | Download (ext.)
 
[96]
2011 | Conference Paper | IST-REx-ID: 3351   OA
On memoryless quantitative objectives
K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159.
View | DOI | Download (ext.)
 
[95]
2011 | Conference Paper | IST-REx-ID: 3344
Graph games with reachability objectives
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.
View | DOI
 
[94]
2011 | Report | IST-REx-ID: 3363   OA
The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, The Decidability Frontier for Probabilistic Automata on Infinite Words, ArXiv, n.d.
View | Download (ext.)
 
[93]
2011 | Conference Paper | IST-REx-ID: 3356
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3864   OA
Measuring and synthesizing systems in probabilistic environments
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.
View | Files available | DOI | Download (ext.)
 
[91]
2010 | Conference Paper | IST-REx-ID: 3852   OA
Discounting in games across time scales
K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29.
View | Files available | DOI | Download (ext.) | arXiv
 
[90]
2010 | Conference Paper | IST-REx-ID: 3857
Probabilistic Automata on infinite words: decidability and undecidability results
K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3865
Analyzing the impact of change in multi-threaded programs
K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 293–307.
View | DOI
 
[88]
2010 | Conference Paper | IST-REx-ID: 3860   OA
Generalized mean-payoff and energy games
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.
View | Files available | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3853   OA
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.
View | Files available | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3858
The complexity of partial-observation parity games
K. Chatterjee, L. Doyen, in:, C. Fermüller, A. Voronkov (Eds.), Springer, 2010, pp. 1–14.
View | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3866   OA
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.
View | Files available | DOI
 
[84]
2010 | Conference Paper | IST-REx-ID: 3854
Obliging games
K. Chatterjee, F. Horn, C. Löding, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–296.
View | DOI
 
[83]
2010 | Conference (Editor) | IST-REx-ID: 3859
FORMATS: Formal modeling and analysis of timed systems
K. Chatterjee, T.A. Henzinger, eds., FORMATS: Formal Modeling and Analysis of Timed Systems, Springer, 2010.
View | DOI
 
[82]
2010 | Journal Article | IST-REx-ID: 3861
Strategy logic
K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.
View | Files available | DOI
 
[81]
2010 | Conference Paper | IST-REx-ID: 4388   OA
GIST: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.
View | Files available | DOI | Download (ext.) | arXiv
 
[80]
2010 | Journal Article | IST-REx-ID: 3862   OA
Quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 11 (2010) 23.
View | Files available | DOI
 
[79]
2010 | Journal Article | IST-REx-ID: 3867
Expressiveness and closure properties for quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.
View | Files available | DOI
 
[78]
2010 | Conference Paper | IST-REx-ID: 3855
Qualitative analysis of partially-observable Markov Decision Processes
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.
View | Files available | DOI
 
[77]
2010 | Conference Paper | IST-REx-ID: 3856   OA
Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.
View | Files available | DOI | Download (ext.)
 
[76]
2010 | Conference Paper | IST-REx-ID: 3851   OA
Energy parity games
K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 599–610.
View | DOI | Download (ext.) | arXiv
 
[75]
2010 | Journal Article | IST-REx-ID: 3863
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.
View | Files available | DOI
 
[74]
2010 | Journal Article | IST-REx-ID: 3868
Algorithms for game metrics
K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer Science 6 (2010) 1–27.
View | Files available | DOI
 
[73]
2010 | Technical Report | IST-REx-ID: 5388   OA
Quantitative synthesis for concurrent programs
K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.
View | Files available
 
[72]
2010 | Technical Report | IST-REx-ID: 5390   OA
Topological, automata-theoretic and logical characterization of finitary languages
K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization of Finitary Languages, IST Austria, 2010.
View | Files available
 
[71]
2009 | Conference Paper | IST-REx-ID: 3871   OA
Probabilistic weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 244–258.
View | Files available | DOI
 
[70]
2009 | Conference Paper | IST-REx-ID: 4545   OA
A survey of stochastic games with limsup and liminf objectives
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.
View | Files available | DOI
 
[69]
2009 | Conference Paper | IST-REx-ID: 4569   OA
Better quality in synthesis through quantitative objectives
R. Bloem, K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009, pp. 140–156.
View | DOI | Download (ext.) | arXiv
 
[68]
2009 | Journal Article | IST-REx-ID: 3869
Qualitative logics and equivalences for probabilistic systems
K. Chatterjee, L. De Alfaro, M. Faella, A. Legay, Logical Methods in Computer Science 5 (2009).
View | DOI
 
[67]
2009 | Conference Paper | IST-REx-ID: 4540
Expressiveness and closure properties for quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, IEEE, 2009, pp. 199–208.
View | Files available | DOI
 
[66]
2009 | Technical Report | IST-REx-ID: 5392   OA
Probabilistic automata on infinite words: Decidability and undecidability results
K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and Undecidability Results, IST Austria, 2009.
View | Files available
 
[65]
2009 | Conference Paper | IST-REx-ID: 4542   OA
Alternating weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.
View | Files available | DOI
 
[64]
2009 | Conference Paper | IST-REx-ID: 4580   OA
Alpaga: A tool for solving parity games with imperfect information
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 58–61.
View | Files available | DOI | Download (ext.)
 
[63]
2009 | Technical Report | IST-REx-ID: 5393
Gist: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.
View | Files available
 
[62]
2009 | Conference Paper | IST-REx-ID: 4543
Stochastic games with finitary objectives
K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.
View | DOI
 
[61]
2009 | Technical Report | IST-REx-ID: 5394   OA
Improved lower bounds for request-response and finitary Streett games
K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.
View | Files available
 
[60]
2009 | Journal Article | IST-REx-ID: 3870   OA
Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational Logic (TOCL) 11 (2009).
View | Files available | DOI
 
[59]
2009 | Conference Paper | IST-REx-ID: 3503   OA
Probabilistic systems with limsup and liminf objectives
K. Chatterjee, T.A. Henzinger, in:, Springer, 2009, pp. 32–45.
View | DOI | Download (ext.)
 
[58]
2009 | Conference Paper | IST-REx-ID: 4544   OA
Termination criteria for solving concurrent safety and reachability games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2009, pp. 197–206.
View | Files available | DOI | Download (ext.)
 
[57]
2009 | Technical Report | IST-REx-ID: 5395   OA
Qualitative analysis of partially-observable Markov decision processes
K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.
View | Files available
 
[56]
2008 | Conference Paper | IST-REx-ID: 3876
Timed parity games: complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 124–140.
View | Files available | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3504   OA
Algorithms for game metrics
K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 107–118.
View | Files available | DOI
 
[54]
2008 | Book Chapter | IST-REx-ID: 3872
Value iteration
K. Chatterjee, T.A. Henzinger, in:, 25 Years in Model Checking, Springer, 2008, pp. 107–138.
View | DOI
 
[53]
2008 | Conference Paper | IST-REx-ID: 3877
Environment assumptions for synthesis
K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 147–161.
View | DOI
 
[52]
2008 | Conference Paper | IST-REx-ID: 4546
Logical reliability of interacting real-time tasks
K. Chatterjee, A. Ghosal, T.A. Henzinger, D. Iercan, C. Kirsch, C. Pinello, A. Sangiovanni Vincentelli, in:, IEEE, 2008, pp. 909–914.
View | DOI | Download (ext.)
 
[51]
2008 | Journal Article | IST-REx-ID: 4534
Reduction of stochastic parity to stochastic mean-payoff games
K. Chatterjee, T.A. Henzinger, Information Processing Letters 106 (2008) 1–7.
View | DOI | Download (ext.)
 
[50]
2008 | Conference Paper | IST-REx-ID: 3501
Assigning trust to Wikipedia content
B.T. Adler, K. Chatterjee, L. De Alfaro, M. Faella, I. Pye, V. Raman, in:, ACM, 2008.
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3873
Controller synthesis with budget constraints
K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2008, pp. 72–86.
View | DOI
 
[48]
2008 | Conference Paper | IST-REx-ID: 3878   OA
The complexity of coverage
K. Chatterjee, L. De Alfaro, R. Majumdar, in:, Springer, 2008, pp. 91–106.
View | DOI | Download (ext.)
 
[47]
2008 | Conference Paper | IST-REx-ID: 3880
Strategy construction for parity games with imperfect information
D. Berwanger, K. Chatterjee, L. Doyen, T.A. Henzinger, S. Raje, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 325–339.
View | Files available | DOI
 
[46]
2008 | Conference Paper | IST-REx-ID: 3502
Robust content-driven reputation
K. Chatterjee, L. De Alfaro, I. Pye, in:, ACM, 2008, pp. 33–42.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3874
Trading infinite memory for uniform randomness in timed games
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 87–100.
View | DOI
 
[44]
2008 | Conference Paper | IST-REx-ID: 3879
Quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2008, pp. 385–400.
View | DOI
 
[43]
2008 | Journal Article | IST-REx-ID: 4548
Stochastic limit-average games are in EXPTIME
K. Chatterjee, R. Majumdar, T.A. Henzinger, International Journal of Game Theory 37 (2008) 219–234.
View | DOI | Download (ext.)
 
[42]
2008 | Conference Paper | IST-REx-ID: 3875
Model-checking omega-regular properties of interval Markov chains
K. Chatterjee, T.A. Henzinger, K. Sen, in:, Springer, 2008, pp. 302–317.
View | DOI
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Generalized parity games
K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Springer, 2007, pp. 153–167.
View | DOI
 
[40]
2007 | Conference Paper | IST-REx-ID: 3884
Strategy logic
K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 59–73.
View | Files available | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3885
Optimal strategy synthesis in stochastic Müller games
K. Chatterjee, in:, Springer, 2007, pp. 138–152.
View | DOI
 
[38]
2007 | Journal Article | IST-REx-ID: 4547
Algorithms for omega-regular games with imperfect information
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, Logical Methods in Computer Science 3 (2007) 1–23.
View | DOI
 
[37]
2007 | Thesis | IST-REx-ID: 4559
Stochastic ω-Regular Games
K. Chatterjee, Stochastic ω-Regular Games, University of California, Berkeley, 2007.
View | Download (ext.)
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Stochastic Müller games are PSPACE-complete
K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 436–448.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3881
Qualitative logics and equivalences for probabilistic systems
L. De Alfaro, K. Chatterjee, M. Faella, A. Legay, in:, IEEE, 2007, pp. 237–248.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 3887
Markov decision processes with multiple long-run average objectives
K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 473–484.
View | DOI
 
[33]
2007 | Conference Paper | IST-REx-ID: 4537
Assume-guarantee synthesis
K. Chatterjee, T.A. Henzinger, in:, Springer, 2007, pp. 261–275.
View | DOI
 
[32]
2007 | Journal Article | IST-REx-ID: 3882
Concurrent games with tail objectives
K. Chatterjee, Theoretical Computer Science 388 (2007) 181–198.
View | DOI
 
[31]
2006 | Conference Paper | IST-REx-ID: 3888
Strategy improvement for stochastic Rabin and Streett games
K. Chatterjee, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2006, pp. 375–389.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3890
The complexity of quantitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2006, pp. 678–687.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 4552
Strategy improvement for concurrent reachability games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, IEEE, 2006, pp. 291–300.
View | DOI
 
[28]
2006 | Conference Paper | IST-REx-ID: 4538
Strategy improvement and randomized subexponential algorithms for stochastic parity games
K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 512–523.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3889
Algorithms for omega-regular games with imperfect information
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Springer, 2006, pp. 287–302.
View | DOI
 
[26]
2006 | Conference Paper | IST-REx-ID: 3891
Concurrent games with tail objectives
K. Chatterjee, in:, Springer, 2006, pp. 256–270.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3500
Algorithms for Büchi Games
K. Chatterjee, T.A. Henzinger, N. Piterman, in:, ACM, 2006.
View | Download (ext.)
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 257–271.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 3449
Games for controls
K. Chatterjee, R. Jagadeesan, C. Pitcher, in:, IEEE, 2006, pp. 70–82.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 3499
Nash equilibrium for upward-closed objectives
K. Chatterjee, in:, Springer, 2006, pp. 271–286.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Games with secure equilibria
K. Chatterjee, T.A. Henzinger, M. Jurdziński, Theoretical Computer Science 365 (2006) 67–82.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Compositional quantitative reasoning
K. Chatterjee, L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:, IEEE, 2006, pp. 179–188.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4551
Markov decision processes with multiple objectives
K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2006, pp. 325–336.
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 4557
Counterexample-guided planning
K. Chatterjee, T.A. Henzinger, R. Jhala, R. Majumdar, in:, AUAI Press, 2005, pp. 104–111.
View | Download (ext.)
 
[17]
2005 | Conference Paper | IST-REx-ID: 3896
Complexity of compositional model checking of computation tree logic on simple structures
K. Chatterjee, P. Dasgupta, P. Chakrabarti, in:, Springer, 2005, pp. 89–102.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 4541
Semiperfect-information games
K. Chatterjee, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005, pp. 1–18.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4553
The complexity of stochastic Rabin and Streett games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, Springer, 2005, pp. 878–890.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4560
Verifying quantitative properties using bound functions
A. Chakrabarti, K. Chatterjee, T.A. Henzinger, O. Kupferman, R. Majumdar, in:, Springer, 2005, pp. 50–64.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 3892
Games with secure equilibria
K. Chatterjee, T.A. Henzinger, M. Jurdziński, in:, Springer, 2005, pp. 141–161.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4554
Mean-payoff parity games
K. Chatterjee, T.A. Henzinger, M. Jurdziński, in:, IEEE, 2005, pp. 178–187.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3893
Two-player nonzero-sum ω-regular games
K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005, pp. 413–427.
View | DOI
 
[10]
2004 | Conference Paper | IST-REx-ID: 3895
Games with secure equilibria
K. Chatterjee, T.A. Henzinger, M. Jurdziński, in:, IEEE, 2004, pp. 160–169.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 4558
Quantitative stochastic parity games
K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, SIAM, 2004, pp. 121–130.
View
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Trading memory for randomness
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, IEEE, 2004, pp. 206–217.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 3894
On Nash equilibria in stochastic games
K. Chatterjee, R. Majumdar, M. Jurdziński, in:, Springer, 2004, pp. 26–40.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Stack size analysis for interrupt-driven programs
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, Information and Computation 194 (2004) 144–174.
View | DOI
 
[5]
2003 | Journal Article | IST-REx-ID: 3593
A branching time temporal framework for quantitative reasoning
K. Chatterjee, P. Dasgupta, P. Chakrabarti, Journal of Automated Reasoning 30 (2003) 205–232.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3897
Simple stochastic parity games
K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, Springer, 2003, pp. 100–113.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3898
Stack size analysis for interrupt-driven programs
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, in:, Springer, 2003, pp. 109–126.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Implementation of shape grammar for plan analysis
S. Mallick, K. Chatterjee, A. Merchant, P. Dasgupta, in:, Elsevier, 2002.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Weighted quantified computation tree logic
K. Chatterjee, P. Dasgupta, P. Chakrabarti, in:, Elsevier, 2001.
View
 

Search

Filter Publications

Display / Sort

Export / Embed