347 Publications

Mark all

[347]
2019 | Conference Paper | IST-REx-ID: 6490
K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 400–408.
View | DOI
 
[346]
2019 | Conference Paper | IST-REx-ID: 6887   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140, p. 7.
View | Files available | DOI
 
[345]
2019 | Conference Paper | IST-REx-ID: 5948
H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,” vol. 11388. Springer, pp. 468–490, 2019.
View | DOI
 
[344]
2019 | Conference Paper | IST-REx-ID: 6175   OA
P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019), Phoenix, AZ, United States, 2019, pp. 204–220.
View | Files available | DOI | arXiv
 
[343]
2019 | Conference Paper | IST-REx-ID: 6889   OA
K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140, p. 6.
View | Files available | DOI
 
[342]
2019 | Conference Paper | IST-REx-ID: 6942   OA
P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman, “Strategy representation by decision trees with linear classifiers,” in 16th International Conference on Quantitative Evaluation of Systems, Glasgow, United Kingdom, 2019, vol. 11785, pp. 109–128.
View | DOI | Download (ext.) | arXiv
 
[341]
2019 | Journal Article | IST-REx-ID: 6380   OA
K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, p. 53, 2019.
View | Files available | DOI
 
[340]
2019 | Conference Paper | IST-REx-ID: 6378   OA
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 374–381.
View | Files available | DOI
 
[339]
2019 | Conference Paper | IST-REx-ID: 6462   OA
G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger, “Run-time optimization for learned controllers through quantitative games,” in 31st International Conference on Computer-Aided Verification, New York, NY, United States, 2019, vol. 11561, pp. 630–649.
View | Files available | DOI
 
[338]
2019 | Conference Paper | IST-REx-ID: 6056   OA
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019, p. 8751326.
View | DOI | Download (ext.) | arXiv
 
[337]
2019 | Conference Paper | IST-REx-ID: 6885   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140, p. 27.
View | Files available | DOI
 
[336]
2019 | Conference Paper | IST-REx-ID: 6780   OA
M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Athens, Greece.
View | Files available | Download (ext.) | arXiv
 
[335]
2019 | Journal Article | IST-REx-ID: 6836
O. P. Hauser, C. Hilbe, K. Chatterjee, and M. A. Nowak, “Social dilemmas among unequals,” Nature, vol. 572, no. 7770, pp. 524–527, 2019.
View | Files available | DOI
 
[334]
2018 | Conference Paper | IST-REx-ID: 143   OA
T. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033, pp. 185–194.
View | DOI | Download (ext.)
 
[333]
2018 | Journal Article | IST-REx-ID: 198   OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140, 2018.
View | Files available | DOI
 
[332]
2018 | Conference Paper | IST-REx-ID: 35   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.
View | Download (ext.) | arXiv
 
[331]
2018 | Book Chapter | IST-REx-ID: 59
R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Modeling Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.
View | DOI
 
[330]
2018 | Conference Paper | IST-REx-ID: 66   OA
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies.,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118, p. 11.
View | Files available | DOI | Download (ext.) | arXiv
 
[329]
2018 | Conference Paper | IST-REx-ID: 24   OA
K. Chatterjee, A. Elgyütt, P. Novotny, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.
View | DOI | Download (ext.) | arXiv
 
[328]
2018 | Conference Paper | IST-REx-ID: 310   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, USA, 2018, pp. 2341–2356.
View | DOI | Download (ext.) | arXiv
 
[327]
2018 | Journal Article | IST-REx-ID: 6009   OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, p. 9, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
[326]
2018 | Journal Article | IST-REx-ID: 5993   OA
K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, p. 7, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
[325]
2018 | Conference Paper | IST-REx-ID: 6340   OA
A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.
View | Files available | arXiv
 
[324]
2018 | Conference Paper | IST-REx-ID: 79   OA
S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.
View | DOI | Download (ext.) | arXiv
 
[323]
2018 | Journal Article | IST-REx-ID: 738   OA
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1, pp. 166–207, 2018.
View | Files available | DOI
 
[322]
2018 | Journal Article | IST-REx-ID: 454   OA
J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” Nature Communications, vol. 9, no. 1, p. 555, 2018.
View | Files available | DOI
 
[321]
2018 | Book Chapter | IST-REx-ID: 86
K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.
View | DOI
 
[320]
2018 | Journal Article | IST-REx-ID: 157
C. Hilbe, Š. Šimsa, K. Chatterjee, and M. Nowak, “Evolution of cooperation in stochastic games,” Nature, vol. 559, no. 7713, pp. 246–249, 2018.
View | Files available | DOI
 
[319]
2018 | Conference Paper | IST-REx-ID: 25
K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.
View | DOI
 
[318]
2018 | Conference Paper | IST-REx-ID: 311   OA
K. Chatterjee, A. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.
View | Files available | DOI
 
[317]
2018 | Conference Paper | IST-REx-ID: 141   OA
K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.
View | Files available | DOI
 
[316]
2018 | Journal Article | IST-REx-ID: 2   OA
C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private noisy and incomplete information,” PNAS, vol. 115, no. 48, pp. 12241–12246, 2018.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[315]
2018 | Conference Paper | IST-REx-ID: 297   OA
T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.
View | Files available | DOI
 
[314]
2018 | Conference Paper | IST-REx-ID: 325   OA
S. Agrawal, K. Chatterjee, and P. Novotny, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.
View | DOI | Download (ext.) | arXiv
 
[313]
2018 | Conference Paper | IST-REx-ID: 34   OA
K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.
View | Download (ext.) | arXiv
 
[312]
2018 | Journal Article | IST-REx-ID: 419
C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” Nature Human Behaviour, vol. 2, pp. 469–477, 2018.
View | Files available | DOI
 
[311]
2018 | Conference Paper | IST-REx-ID: 5679   OA
M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.
View | DOI | Download (ext.) | arXiv
 
[310]
2018 | Preprint | IST-REx-ID: 5977   OA
K. Chatterjee, H. Fu, A. Goharshady, and N. Okati, “Computational Approaches for Stochastic Shortest Path on Succinct MDPs,” ArXiv. ArXiv.
View | Download (ext.) | arXiv
 
[309]
2018 | Journal Article | IST-REx-ID: 5751   OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1, p. 71, 2018.
View | Files available | DOI
 
[308]
2017 | Journal Article | IST-REx-ID: 681   OA
K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for omega-regular games,” Information and Computation, vol. 254, pp. 296–315, 2017.
View | DOI | Download (ext.)
 
[307]
2017 | Journal Article | IST-REx-ID: 744
T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” Journal of Theoretical Biology, vol. 433, pp. 64–72, 2017.
View | DOI
 
[306]
2017 | Journal Article | IST-REx-ID: 465   OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
[305]
2017 | Journal Article | IST-REx-ID: 1407   OA
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, pp. 230–253, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 
[304]
2017 | Journal Article | IST-REx-ID: 1065   OA
K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” Information Processing Letters, vol. 122, pp. 25–29, 2017.
View | Files available | DOI
 
[303]
2017 | Conference Paper | IST-REx-ID: 1009   OA
K. Chatterjee, P. Novotny, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.
View | Download (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 1011   OA
K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “ Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.
View | DOI | Download (ext.)
 
[301]
2017 | Journal Article | IST-REx-ID: 1080   OA
J. Reiter et al., “Reconstructing metastatic seeding patterns of human cancers,” Nature Communications, vol. 8, 2017.
View | Files available | DOI
 
[300]
2017 | Journal Article | IST-REx-ID: 1066
K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” Information and Computation, vol. 254, no. 2, pp. 143–166, 2017.
View | Files available | DOI
 
[299]
2017 | Technical Report | IST-REx-ID: 5455   OA
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
View | Files available | DOI
 
[298]
2017 | Book Chapter | IST-REx-ID: 625
K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.
View | DOI
 
[297]
2017 | Journal Article | IST-REx-ID: 719
K. Chatterjee and R. Ehlers, “Special issue: Synthesis and SYNT 2014,” Acta Informatica, vol. 54, no. 6, pp. 543–544, 2017.
View | DOI
 
[296]
2017 | Journal Article | IST-REx-ID: 466   OA
K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2, p. 15, 2017.
View | Files available | DOI
 
[295]
2017 | Journal Article | IST-REx-ID: 512   OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1, p. 82, 2017.
View | Files available | DOI
 
[294]
2017 | Journal Article | IST-REx-ID: 1294   OA
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” Journal of Computer and System Sciences, vol. 84, pp. 144–170, 2017.
View | Files available | DOI
 
[293]
2017 | Conference Paper | IST-REx-ID: 1194   OA
K. Chatterjee, P. Novotny, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160.
View | DOI | Download (ext.)
 
[292]
2017 | Technical Report | IST-REx-ID: 5456   OA
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
View | Files available | DOI
 
[291]
2017 | Conference Paper | IST-REx-ID: 551   OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
[290]
2017 | Conference Paper | IST-REx-ID: 645   OA
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.
View | DOI | Download (ext.)
 
[289]
2017 | Journal Article | IST-REx-ID: 671   OA
C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” PNAS, vol. 114, no. 18, pp. 4715–4720, 2017.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[288]
2017 | Journal Article | IST-REx-ID: 467   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, p. 31, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 
[287]
2017 | Conference Paper | IST-REx-ID: 552   OA
K. Chatterjee, M. Henzinger, and A. Svozil, “Faster algorithms for mean payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
[286]
2017 | Conference Paper | IST-REx-ID: 639   OA
K. Chatterjee, H. Fu, and A. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.
View | DOI | Download (ext.)
 
[285]
2017 | Journal Article | IST-REx-ID: 653
A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3, pp. 358–366, 2017.
View | DOI
 
[284]
2017 | Journal Article | IST-REx-ID: 684   OA
K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” Journal of Symbolic Logic, vol. 82, no. 2, pp. 420–452, 2017.
View | DOI | Download (ext.)
 
[283]
2017 | Conference Paper | IST-REx-ID: 711   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85.
View | Files available | DOI
 
[282]
2017 | Journal Article | IST-REx-ID: 716
K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5, p. 34, 2017.
View | DOI
 
[281]
2017 | Conference Paper | IST-REx-ID: 949   OA
K. Chatterjee, A. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.
View | Files available | DOI
 
[280]
2017 | Journal Article | IST-REx-ID: 464   OA
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
[279]
2017 | Conference Paper | IST-REx-ID: 553   OA
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI | Download (ext.)
 
[278]
2017 | Conference Paper | IST-REx-ID: 628   OA
K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139.
View | DOI | Download (ext.)
 
[277]
2017 | Conference Paper | IST-REx-ID: 6519   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82, p. 18.
View | Files available | DOI
 
[276]
2017 | Research Data | IST-REx-ID: 5559
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , Strong amplifiers of natural selection. IST Austria, 2017.
View | Files available | DOI
 
[275]
2017 | Journal Article | IST-REx-ID: 717
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” Journal of Computer and System Sciences, vol. 88, pp. 236–259, 2017.
View | Files available | DOI | Download (ext.)
 
[274]
2016 | Conference Paper | IST-REx-ID: 1166
K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.
View | Files available
 
[273]
2016 | Conference Paper | IST-REx-ID: 1438
K. Chatterjee, H. Fu, P. Novotny, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.
View | Files available | DOI | Download (ext.) | arXiv
 
[272]
2016 | Conference Paper | IST-REx-ID: 478   OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.
View | Files available | DOI
 
[271]
2016 | Conference Paper | IST-REx-ID: 480   OA
K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.
View | DOI | Download (ext.)
 
[270]
2016 | Journal Article | IST-REx-ID: 1477
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5, pp. 878–911, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[269]
2016 | Conference Paper | IST-REx-ID: 1182   OA
K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.
View | Files available | Download (ext.)
 
[268]
2016 | Conference Paper | IST-REx-ID: 1245
V. Pandey and K. Chatterjee, “Game-theoretic models identify useful principles for peer collaboration in online learning platforms,” in Proceedings of the ACM Conference on Computer Supported Cooperative Work, San Francisco, CA, USA, 2016, vol. 26, no. Februar-2016, pp. 365–368.
View | DOI
 
[267]
2016 | Conference Paper | IST-REx-ID: 1327   OA
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotny, “Stochastic shortest path with energy constraints in POMDPs,” in Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, Singapore, 2016, pp. 1465–1466.
View | Download (ext.)
 
[266]
2016 | Journal Article | IST-REx-ID: 1529
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234, pp. 26–48, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[265]
2016 | Technical Report | IST-REx-ID: 5451   OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.
View | Files available | DOI
 
[264]
2016 | Technical Report | IST-REx-ID: 5449
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.
View | Files available | DOI
 
[263]
2016 | Conference Paper | IST-REx-ID: 1068   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.
View | Files available | DOI
 
[262]
2016 | Conference Paper | IST-REx-ID: 1070   OA
K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.
View | Files available | DOI
 
[261]
2016 | Conference Paper | IST-REx-ID: 1138   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative automata under probabilistic semantics,” in Proceedings of the 31st Annual ACM/IEEE Symposium, New York, NY, USA, 2016, pp. 76–85.
View | DOI | Download (ext.)
 
[260]
2016 | Conference Paper | IST-REx-ID: 1140   OA
K. Chatterjee, W. Dvoák, M. Henzinger, and V. Loitzenbauer, “Model and objective separation with conditional lower bounds disjunction is harder than conjunction,” in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York, NY, USA, 2016, pp. 197–206.
View | DOI | Download (ext.)
 
[259]
2016 | Conference Paper | IST-REx-ID: 1335   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative monitor automata,” presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom, 2016, vol. 9837, pp. 23–38.
View | DOI | Download (ext.)
 
[258]
2016 | Technical Report | IST-REx-ID: 5445   OA
K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
View | Files available | DOI
 
[257]
2016 | Technical Report | IST-REx-ID: 5452
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
View | Files available | DOI
 
[256]
2016 | Conference Paper | IST-REx-ID: 1090   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland, 2016, vol. 58.
View | Files available | DOI
 
[255]
2016 | Conference Paper | IST-REx-ID: 1324
K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, London, United Kingdom, 2016, vol. 2016–January, pp. 88–96.
View | Download (ext.)
 
[254]
2016 | Conference Paper | IST-REx-ID: 1386   OA
K. Chatterjee, H. Fu, and A. Goharshady, “Termination analysis of probabilistic programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9779, pp. 3–22.
View | DOI | Download (ext.)
 
[253]
2016 | Technical Report | IST-REx-ID: 5453   OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
View | Files available | DOI
 
[252]
2016 | Conference Paper | IST-REx-ID: 1071
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
View | Files available | DOI
 
[251]
2016 | Conference Paper | IST-REx-ID: 1437
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
View | Files available | DOI | Download (ext.) | arXiv
 
[250]
2015 | Conference Paper | IST-REx-ID: 1609   OA
K. Chatterjee, L. Doyen, and M. Vardi, “The complexity of synthesis from probabilistic components,” vol. 9135. Springer, pp. 108–120, 2015.
View | DOI | Download (ext.)
 
[249]
2015 | Journal Article | IST-REx-ID: 1673   OA
B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181, p. 20150114, 2015.
View | Files available | DOI
 
[248]
2015 | Conference Paper | IST-REx-ID: 1820   OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.
View | Files available | Download (ext.) | arXiv
 
[247]
2015 | Journal Article | IST-REx-ID: 1856
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1, 2015.
View | Files available | DOI | Download (ext.)
 
[246]
2015 | Journal Article | IST-REx-ID: 1731
K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12, pp. 3–16, 2015.
View | Files available | DOI | Download (ext.)
 
[245]
2015 | Conference Paper | IST-REx-ID: 1661
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July, p. 7174888.
View | Files available | DOI | Download (ext.)
 
[244]
2015 | Journal Article | IST-REx-ID: 523   OA
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” Information and Computation, vol. 242, no. 6, pp. 25–52, 2015.
View | Files available | DOI | Download (ext.)
 
[243]
2015 | Technical Report | IST-REx-ID: 5430
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View | Files available | DOI
 
[242]
2015 | Journal Article | IST-REx-ID: 1604
K. Chatterjee, A. Pavlogiannis, and Y. Velner, “Quantitative interprocedural analysis,” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1, pp. 539–551, 2015.
View | Files available | DOI
 
[241]
2015 | Technical Report | IST-REx-ID: 5435
K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
View | Files available | DOI
 
[240]
2015 | Journal Article | IST-REx-ID: 1559   OA
R. Ibsen-Jensen, K. Chatterjee, and M. Nowak, “Computational complexity of ecological and evolutionary spatial dynamics,” PNAS, vol. 112, no. 51, pp. 15636–15641, 2015.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[239]
2015 | Journal Article | IST-REx-ID: 1624   OA
A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” Scientific Reports, vol. 5, 2015.
View | Files available | DOI
 
[238]
2015 | Journal Article | IST-REx-ID: 1698   OA
Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” Information and Computation, vol. 241, no. 4, pp. 177–196, 2015.
View | DOI | Download (ext.)
 
[237]
2015 | Journal Article | IST-REx-ID: 1681   OA
T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” Games, vol. 6, no. 4, pp. 413–437, 2015.
View | Files available | DOI
 
[236]
2015 | Conference Paper | IST-REx-ID: 1838   OA
R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee synthesis for concurrent reactive programs with partial information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom, 2015, vol. 9035, pp. 517–532.
View | DOI | Download (ext.)
 
[235]
2015 | Journal Article | IST-REx-ID: 524
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6, pp. 2–24, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[234]
2015 | Conference Paper | IST-REx-ID: 1732
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5443   OA
K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.
View | Files available | DOI
 
[232]
2015 | Technical Report | IST-REx-ID: 5431   OA
K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.
View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5429
K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
View | Files available | DOI
 
[230]
2015 | Technical Report | IST-REx-ID: 5436
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.
View | Files available | DOI
 
[229]
2015 | Journal Article | IST-REx-ID: 1694
K. Chatterjee and V. Prabhu, “Quantitative temporal simulation and refinement distances for timed systems,” IEEE Transactions on Automatic Control, vol. 60, no. 9, pp. 2291–2306, 2015.
View | DOI
 
[228]
2015 | Conference Paper | IST-REx-ID: 1839   OA
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer, pp. 181–187, 2015.
View | DOI | Download (ext.)
 
[227]
2015 | Journal Article | IST-REx-ID: 2034   OA
B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” Information Processing Letters, vol. 115, no. 1, pp. 52–59, 2015.
View | DOI | Download (ext.)
 
[226]
2015 | Journal Article | IST-REx-ID: 1598
K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3, pp. 71–89, 2015.
View | Files available | DOI | Download (ext.)
 
[225]
2015 | Technical Report | IST-REx-ID: 5437   OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View | Files available | DOI
 
[224]
2015 | Technical Report | IST-REx-ID: 5444   OA
J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.
View | Files available | DOI
 
[223]
2015 | Conference Paper | IST-REx-ID: 1714
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.
View | Files available | DOI
 
[222]
2015 | Technical Report | IST-REx-ID: 5432
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 
[221]
2015 | Conference Paper | IST-REx-ID: 1656
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July, p. 7174926.
View | Files available | DOI | arXiv
 
[220]
2015 | Journal Article | IST-REx-ID: 1873   OA
K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” Artificial Intelligence, vol. 221, pp. 46–72, 2015.
View | DOI | Download (ext.) | arXiv
 
[219]
2015 | Conference Paper | IST-REx-ID: 1481
U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” presented at the AAAI: Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752.
View | Files available | Download (ext.)
 
[218]
2015 | Journal Article | IST-REx-ID: 1501
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” Formal Methods in System Design, vol. 47, no. 2, pp. 230–264, 2015.
View | Files available | DOI | Download (ext.)
 
[217]
2015 | Journal Article | IST-REx-ID: 1602
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1, pp. 97–109, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[216]
2015 | Conference Paper | IST-REx-ID: 1607
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.
View | Files available | DOI | Download (ext.)
 
[215]
2015 | Technical Report | IST-REx-ID: 5440
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 
[214]
2015 | Technical Report | IST-REx-ID: 5438
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
View | Files available | DOI
 
[213]
2015 | Conference Paper | IST-REx-ID: 1657
K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.
View | Files available | DOI
 
[212]
2015 | Conference Paper | IST-REx-ID: 1691
M. Svoreňová et al., “Temporal logic motion planning using POMDPs with parity objectives: Case study paper,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 233–238.
View | DOI
 
[211]
2015 | Journal Article | IST-REx-ID: 1709   OA
J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological auctions with multiple rewards,” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 282, no. 1812, 2015.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[210]
2015 | Conference Paper | IST-REx-ID: 1603
T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.
View | Files available | DOI | Download (ext.)
 
[209]
2015 | Technical Report | IST-REx-ID: 5441
K. Chatterjee, R. Ibsen-Jensen, A. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
View | Files available | DOI
 
[208]
2015 | Conference Paper | IST-REx-ID: 1610
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” vol. 9135, no. Part II. Springer, pp. 121–133, 2015.
View | Files available | DOI
 
[207]
2015 | Conference Paper | IST-REx-ID: 1689
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.
View | Files available | DOI | Download (ext.)
 
[206]
2014 | Journal Article | IST-REx-ID: 1375   OA
K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” Theoretical Computer Science, vol. 547, no. C, pp. 104–116, 2014.
View | DOI | Download (ext.)
 
[205]
2014 | Journal Article | IST-REx-ID: 2234   OA
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” Logical Methods in Computer Science, vol. 10, no. 1, 2014.
View | Files available | DOI | Download (ext.)
 
[204]
2014 | Journal Article | IST-REx-ID: 535   OA
K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3, pp. 457–492, 2014.
View | DOI | Download (ext.)
 
[203]
2014 | Technical Report | IST-REx-ID: 5423   OA
K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria, 2014.
View | Files available | DOI
 
[202]
2014 | Technical Report | IST-REx-ID: 5428   OA
K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014.
View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2063
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.
View | Files available | DOI
 
[200]
2014 | Journal Article | IST-REx-ID: 2716   OA
K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4, pp. 129–163, 2014.
View | DOI | Download (ext.)
 
[199]
2014 | Journal Article | IST-REx-ID: 2141
K. Chatterjee and M. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3, 2014.
View | Files available | DOI | Download (ext.)
 
[198]
2014 | Journal Article | IST-REx-ID: 2038
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, p. 27, 2014.
View | Files available | DOI
 
[197]
2014 | Conference Paper | IST-REx-ID: 2216
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.
View | Files available | DOI | Download (ext.)
 
[196]
2014 | Technical Report | IST-REx-ID: 5412
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[195]
2014 | Technical Report | IST-REx-ID: 5424
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View | Files available | DOI
 
[194]
2014 | Journal Article | IST-REx-ID: 2211
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, p. 16, 2014.
View | Files available | DOI | Download (ext.) | arXiv
 
[193]
2014 | Conference Paper | IST-REx-ID: 1903
K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.
View | Files available | DOI
 
[192]
2014 | Conference Paper | IST-REx-ID: 1853
S. Jha, S. Tripakis, S. Seshia, and K. Chatterjee, “Game theoretic secure localization in wireless sensor networks,” presented at the IOT: Internet of Things, Cambridge, USA, 2014, pp. 85–90.
View | DOI
 
[191]
2014 | Conference Paper | IST-REx-ID: 2027   OA
T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
View | DOI | Download (ext.)
 
[190]
2014 | Conference Paper | IST-REx-ID: 2212
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
View | Files available | DOI
 
[189]
2014 | Technical Report | IST-REx-ID: 5413
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[188]
2014 | Technical Report | IST-REx-ID: 5418   OA
K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria, 2014.
View | Files available | DOI
 
[187]
2014 | Technical Report | IST-REx-ID: 5420   OA
K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.
View | Files available | DOI
 
[186]
2014 | Journal Article | IST-REx-ID: 2039   OA
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9, 2014.
View | Files available | DOI
 
[185]
2014 | Conference Paper | IST-REx-ID: 2054
K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.
View | Files available | DOI
 
[184]
2014 | Conference Paper | IST-REx-ID: 2213
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
View | Files available | DOI | Download (ext.) | arXiv
 
[183]
2014 | Conference Paper | IST-REx-ID: 2162
K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
View | Files available | DOI | Download (ext.) | arXiv
 
[182]
2014 | Technical Report | IST-REx-ID: 5426   OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View | Files available | DOI
 
[181]
2014 | Technical Report | IST-REx-ID: 5419   OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
View | Files available | DOI
 
[180]
2014 | Technical Report | IST-REx-ID: 5414   OA
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5421   OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.
View | Files available | DOI
 
[178]
2014 | Journal Article | IST-REx-ID: 2187   OA
R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4, pp. 193–220, 2014.
View | Files available | DOI
 
[177]
2014 | Conference Paper | IST-REx-ID: 2163
K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.
View | Files available | DOI | Download (ext.) | arXiv
 
[176]
2014 | Technical Report | IST-REx-ID: 5427   OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
View | Files available | DOI
 
[175]
2014 | Technical Report | IST-REx-ID: 5415
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.
View | Files available | DOI
 
[174]
2013 | Journal Article | IST-REx-ID: 2816   OA
I. Božić et al., “Evolutionary dynamics of cancer in response to targeted combination therapy,” eLife, vol. 2, 2013.
View | Files available | DOI
 
[173]
2013 | Journal Article | IST-REx-ID: 2854   OA
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” Journal of Computer and System Sciences, vol. 79, no. 5, pp. 640–657, 2013.
View | Files available | DOI
 
[172]
2013 | Technical Report | IST-REx-ID: 5404   OA
K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
View | Files available | DOI
 
[171]
2013 | Technical Report | IST-REx-ID: 5409   OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
View | Files available | DOI
 
[170]
2013 | Journal Article | IST-REx-ID: 2247   OA
B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma ,” PLoS One, vol. 8, no. 12, 2013.
View | Files available | DOI
 
[169]
2013 | Conference (Editor) | IST-REx-ID: 2292
K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854.
View | DOI
 
[168]
2013 | Conference Paper | IST-REx-ID: 2444   OA
K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.
View | DOI | Download (ext.) | arXiv
 
[167]
2013 | Journal Article | IST-REx-ID: 2824
K. Chatterjee and V. Prabhu, “Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems,” Information and Computation, vol. 228–229, pp. 83–119, 2013.
View | DOI
 
[166]
2013 | Journal Article | IST-REx-ID: 2831   OA
K. Chatterjee, M. Henzinger, M. Joglekar, and N. Shah, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” Formal Methods in System Design, vol. 42, no. 3, pp. 301–327, 2013.
View | DOI | Download (ext.) | arXiv
 
[165]
2013 | Journal Article | IST-REx-ID: 2836   OA
K. Chatterjee and V. Raman, “Assume-guarantee synthesis for digital contract signing,” Formal Aspects of Computing, vol. 26, no. 4, pp. 825–859, 2013.
View | DOI | Download (ext.) | arXiv
 
[164]
2013 | Journal Article | IST-REx-ID: 2817   OA
S. Novak, K. Chatterjee, and M. Nowak, “Density games,” Journal of Theoretical Biology, vol. 334, pp. 26–34, 2013.
View | Files available | DOI
 
[163]
2013 | Technical Report | IST-REx-ID: 5400   OA
K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria, 2013.
View | Files available | DOI
 
[162]
2013 | Conference Paper | IST-REx-ID: 1376
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
View | Files available | DOI
 
[161]
2013 | Technical Report | IST-REx-ID: 5405   OA
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information stochastic mean-payoff parity games. IST Austria, 2013.
View | Files available | DOI
 
[160]
2013 | Conference Paper | IST-REx-ID: 2305
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” in 28th Annual ACM/IEEE Symposium, New Orleans, LA, United States, 2013, pp. 331–340.
View | Files available | DOI | Download (ext.) | arXiv
 
[159]
2013 | Conference Paper | IST-REx-ID: 2329   OA
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.
View | Files available | DOI | Download (ext.) | arXiv
 
[158]
2013 | Conference Paper | IST-REx-ID: 2279
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.
View | Files available | DOI | Download (ext.)
 
[157]
2013 | Technical Report | IST-REx-ID: 5406   OA
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 2820
K. Chatterjee, A. Kößler, and U. Schmid, “Automated analysis of real-time scheduling using graph games,” in Proceedings of the 16th International conference on Hybrid systems: Computation and control, Philadelphia, PA, United States, 2013, pp. 163–172.
View | Files available | DOI
 
[155]
2013 | Conference Paper | IST-REx-ID: 2446   OA
K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.
View | DOI | Download (ext.) | arXiv
 
[154]
2013 | Journal Article | IST-REx-ID: 2814   OA
K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” International Journal of Foundations of Computer Science, vol. 24, no. 2, pp. 165–185, 2013.
View | DOI | Download (ext.) | arXiv
 
[153]
2013 | Conference Paper | IST-REx-ID: 2819   OA
K. Chatterjee and V. Prabhu, “Quantitative timed simulation functions and refinement metrics for real-time systems,” in Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Philadelphia, PA USA, 2013, vol. 1, pp. 273–282.
View | DOI | Download (ext.)
 
[152]
2013 | Technical Report | IST-REx-ID: 5399   OA
J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, TTP: Tool for Tumor Progression. IST Austria, 2013.
View | Files available | DOI
 
[151]
2013 | Journal Article | IST-REx-ID: 2299   OA
Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, pp. 585–601, 2013.
View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 1374   OA
K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196.
View | Files available | DOI
 
[149]
2013 | Conference Paper | IST-REx-ID: 2238
K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.
View | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 3116
K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware resource management,” Formal Methods in System Design, vol. 42, no. 2, pp. 142–174, 2013.
View | DOI
 
[147]
2013 | Conference Paper | IST-REx-ID: 2295
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
View | Files available | DOI
 
[146]
2013 | Technical Report | IST-REx-ID: 5403   OA
K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
View | Files available | DOI
 
[145]
2013 | Conference Paper | IST-REx-ID: 2000
J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,” in Proceedings of 25th Int. Conf. on Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 101–106.
View | Files available | DOI | Download (ext.) | arXiv
 
[144]
2013 | Technical Report | IST-REx-ID: 5410   OA
U. Ahmed, K. Chatterjee, and S. Gulwani, Automatic generation of alternative starting positions for traditional board games. IST Austria, 2013.
View | Files available | DOI
 
[143]
2013 | Technical Report | IST-REx-ID: 5408   OA
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria, 2013.
View | Files available | DOI
 
[142]
2013 | Journal Article | IST-REx-ID: 2858   OA
J. Reiter, I. Božić, B. Allen, K. Chatterjee, and M. Nowak, “The effect of one additional driver mutation on tumor progression,” Evolutionary Applications, vol. 6, no. 1, pp. 34–45, 2013.
View | Files available | DOI
 
[141]
2012 | Conference Paper | IST-REx-ID: 2715   OA
K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 2012, vol. 18, pp. 461–473.
View | Files available | DOI
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936   OA
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.
View | DOI | Download (ext.)
 
[139]
2012 | Journal Article | IST-REx-ID: 3314
K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” International Journal of Foundations of Computer Science, vol. 23, no. 3, pp. 609–625, 2012.
View | DOI
 
[138]
2012 | Conference Paper | IST-REx-ID: 2955   OA
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012, p. 6280436.
View | Files available | DOI | Download (ext.) | arXiv
 
[137]
2012 | Technical Report | IST-REx-ID: 5377
K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.
View | Files available | DOI
 
[136]
2012 | Journal Article | IST-REx-ID: 2848   OA
K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” Journal of Theoretical Biology, vol. 301, pp. 161–173, 2012.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[135]
2012 | Conference Paper | IST-REx-ID: 3252   OA
K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.
View | DOI | Download (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3846   OA
K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” Journal of Computer and System Sciences, vol. 78, no. 2, pp. 394–413, 2012.
View | Files available | DOI
 
[133]
2012 | Conference Paper | IST-REx-ID: 497
K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.
View | Files available | DOI
 
[132]
2012 | Technical Report | IST-REx-ID: 5378   OA
K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.
View | Files available | DOI
 
[131]
2012 | Conference Paper | IST-REx-ID: 3341
K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.
View | Files available | DOI | Download (ext.) | arXiv
 
[130]
2012 | Conference Paper | IST-REx-ID: 2956
K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012, p. 6280438.
View | Files available | DOI
 
[129]
2012 | Journal Article | IST-REx-ID: 3260   OA
K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” Theoretical Population Biology, vol. 81, no. 1, pp. 69–80, 2012.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[128]
2012 | Conference Paper | IST-REx-ID: 2957
K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012, p. 6280437.
View | Files available | DOI | Download (ext.) | arXiv
 
[127]
2012 | Journal Article | IST-REx-ID: 3254
K. Chatterjee, “The complexity of stochastic Müller games,” Information and Computation, vol. 211, pp. 29–48, 2012.
View | DOI | Download (ext.)
 
[126]
2012 | Conference Paper | IST-REx-ID: 3165
K. Chatterjee and M. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.
View | Files available | DOI
 
[125]
2012 | Journal Article | IST-REx-ID: 2972   OA
K. Chatterjee and L. Doyen, “Energy parity games,” Theoretical Computer Science, vol. 458, pp. 49–60, 2012.
View | Files available | DOI | arXiv
 
[124]
2012 | Conference Paper | IST-REx-ID: 2947   OA
K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.
View | DOI | Download (ext.)
 
[123]
2012 | Conference Paper | IST-REx-ID: 3135   OA
B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotny, “Efficient controller synthesis for consumption games with multiple resource types,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.
View | DOI | Download (ext.)
 
[122]
2012 | Journal Article | IST-REx-ID: 3128   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” Formal Methods in System Design, vol. 43, no. 2, pp. 268–284, 2012.
View | Files available | DOI
 
[121]
2012 | Conference Paper | IST-REx-ID: 3255
K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.
View | DOI
 
[120]
2011 | Conference Paper | IST-REx-ID: 3357
K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
View | DOI
 
[119]
2011 | Conference Paper | IST-REx-ID: 3345
K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.
View | Files available | DOI | Download (ext.) | arXiv
 
[118]
2011 | Technical Report | IST-REx-ID: 5384   OA
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
View | Files available | DOI
 
[117]
2011 | Preprint | IST-REx-ID: 3338   OA
K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.
View | Files available | Download (ext.) | arXiv
 
[116]
2011 | Conference Paper | IST-REx-ID: 3346   OA
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
View | DOI | Download (ext.)
 
[115]
2011 | Conference Paper | IST-REx-ID: 3365   OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
View | Files available | DOI
 
[114]
2011 | Journal Article | IST-REx-ID: 3315
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4, 2011.
View | Files available | DOI
 
[113]
2011 | Technical Report | IST-REx-ID: 5385   OA
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.
View | Files available | DOI
 
[112]
2011 | Technical Report | IST-REx-ID: 5380
K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.
View | Files available | DOI
 
[111]
2011 | Preprint | IST-REx-ID: 3339   OA
K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for stochastic games with discounted and long-run average objectives,” arXiv. ArXiv, 2011.
View | Download (ext.) | arXiv
 
[110]
2011 | Conference Paper | IST-REx-ID: 3342   OA
K. Chatterjee, M. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
View | DOI | Download (ext.) | arXiv
 
[109]
2011 | Journal Article | IST-REx-ID: 3354
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 2011.
View | Files available | DOI
 
[108]
2011 | Conference Paper | IST-REx-ID: 3361   OA
P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
View | Files available | DOI
 
[107]
2011 | Technical Report | IST-REx-ID: 5379   OA
K. Chatterjee and M. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
View | Files available | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3366
P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
View | Files available | DOI
 
[105]
2011 | Conference Paper | IST-REx-ID: 3347   OA
K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.
View | DOI | Download (ext.) | arXiv
 
[104]
2011 | Conference Paper | IST-REx-ID: 3316
R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.
View | DOI
 
[103]
2011 | Technical Report | IST-REx-ID: 5381
K. Chatterjee and L. Doyen, Partial-observation stochastic games: How to win when belief fails. IST Austria, 2011.
View | Files available | DOI
 
[102]
2011 | Conference Paper | IST-REx-ID: 3348   OA
K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.
View | DOI | Download (ext.)
 
[101]
2011 | Conference Paper | IST-REx-ID: 3350
K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.
View | DOI
 
[100]
2011 | Conference Paper | IST-REx-ID: 3343   OA
K. Chatterjee and M. Henzinger, “Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, USA, 2011, pp. 1318–1336.
View | DOI | Download (ext.)
 
[99]
2011 | Technical Report | IST-REx-ID: 5382   OA
K. Chatterjee, Robustness of structurally equivalent concurrent parity games. IST Austria, 2011.
View | Files available | DOI
 
[98]
2011 | Technical Report | IST-REx-ID: 5387   OA
K. Chatterjee and L. Doyen, Energy and mean-payoff parity Markov decision processes. IST Austria, 2011.
View | Files available | DOI
 
[97]
2011 | Preprint | IST-REx-ID: 3363   OA
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
View | Download (ext.) | arXiv
 
[96]
2011 | Conference Paper | IST-REx-ID: 3349   OA
K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.
View | DOI | Download (ext.)
 
[95]
2011 | Conference Paper | IST-REx-ID: 3351   OA
K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.
View | DOI | Download (ext.)
 
[94]
2011 | Conference Paper | IST-REx-ID: 3344
K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.
View | DOI
 
[93]
2011 | Conference Paper | IST-REx-ID: 3356
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3864   OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.
View | Files available | DOI | Download (ext.)
 
[91]
2010 | Conference Paper | IST-REx-ID: 3857
K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.
View | Files available | DOI
 
[90]
2010 | Conference Paper | IST-REx-ID: 3852   OA
K. Chatterjee and R. Majumdar, “Discounting in games across time scales,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2010, vol. 25, pp. 22–29.
View | Files available | DOI | arXiv
 
[89]
2010 | Conference Paper | IST-REx-ID: 3853   OA
K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.
View | Files available | DOI
 
[88]
2010 | Conference Paper | IST-REx-ID: 3858
K. Chatterjee and L. Doyen, “The complexity of partial-observation parity games,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.
View | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3865
K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact of change in multi-threaded programs,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307.
View | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3860   OA
K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.
View | Files available | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3854
K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.
View | DOI
 
[84]
2010 | Conference Paper | IST-REx-ID: 3866   OA
R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.
View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3861
K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” Information and Computation, vol. 208, no. 6, pp. 677–693, 2010.
View | Files available | DOI
 
[82]
2010 | Conference Paper | IST-REx-ID: 4388
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.
View | Files available | DOI | Download (ext.) | arXiv
 
[81]
2010 | Conference (Editor) | IST-REx-ID: 3859
K. Chatterjee and T. A. Henzinger, Eds., Formal modeling and analysis of timed systems, vol. 6246. Springer, 2010.
View | Files available | DOI
 
[80]
2010 | Journal Article | IST-REx-ID: 3862   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 4, p. 23, 2010.
View | Files available | DOI
 
[79]
2010 | Conference Paper | IST-REx-ID: 3855
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.
View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” Logical Methods in Computer Science, vol. 6, no. 3, pp. 1–23, 2010.
View | Files available | DOI
 
[77]
2010 | Conference Paper | IST-REx-ID: 3856   OA
K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.
View | Files available | DOI | Download (ext.)
 
[76]
2010 | Journal Article | IST-REx-ID: 3868   OA
K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game metrics,” Logical Methods in Computer Science, vol. 6, no. 3, pp. 1–27, 2010.
View | Files available | DOI
 
[75]
2010 | Journal Article | IST-REx-ID: 3863
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” Information and Computation, vol. 208, no. 10, pp. 1206–1220, 2010.
View | Files available | DOI
 
[74]
2010 | Technical Report | IST-REx-ID: 5388   OA
K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.
View | Files available | DOI
 
[73]
2010 | Technical Report | IST-REx-ID: 5390   OA
K. Chatterjee and N. Fijalkow, Topological, automata-theoretic and logical characterization of finitary languages. IST Austria, 2010.
View | Files available | DOI
 
[72]
2010 | Conference Paper | IST-REx-ID: 3851
K. Chatterjee and L. Doyen, “Energy parity games,” presented at the ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France, 2010, vol. 6199, pp. 599–610.
View | Files available | DOI | Download (ext.) | arXiv
 
[71]
2009 | Journal Article | IST-REx-ID: 3869
K. Chatterjee, L. De Alfaro, M. Faella, and A. Legay, “Qualitative logics and equivalences for probabilistic systems,” Logical Methods in Computer Science, vol. 5, no. 2, 2009.
View | DOI
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Probabilistic weighted automata,” presented at the CONCUR: Concurrency Theory, Bologna, Italy, 2009, vol. 5710, pp. 244–258.
View | Files available | DOI
 
[69]
2009 | Conference Paper | IST-REx-ID: 4545   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of stochastic games with limsup and liminf objectives,” presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece, 2009, vol. 5556, pp. 1–15.
View | Files available | DOI
 
[68]
2009 | Conference Paper | IST-REx-ID: 4569   OA
R. Bloem, K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Better quality in synthesis through quantitative objectives,” presented at the CAV: Computer Aided Verification, Grenoble, France, 2009, vol. 5643, pp. 140–156.
View | DOI | Download (ext.) | arXiv
 
[67]
2009 | Conference Paper | IST-REx-ID: 4540
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” presented at the LICS: Logic in Computer Science, 2009, pp. 199–208.
View | Files available | DOI
 
[66]
2009 | Technical Report | IST-REx-ID: 5392   OA
K. Chatterjee, Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria, 2009.
View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4580   OA
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Alpaga: A tool for solving parity games with imperfect information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2009, vol. 5505, pp. 58–61.
View | Files available | DOI | Download (ext.)
 
[64]
2009 | Conference Paper | IST-REx-ID: 4542   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,” presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009, vol. 5699, pp. 3–13.
View | Files available | DOI
 
[63]
2009 | Technical Report | IST-REx-ID: 5393   OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist: A solver for probabilistic games. IST Austria, 2009.
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4543
K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.
View | DOI
 
[61]
2009 | Technical Report | IST-REx-ID: 5394   OA
K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for request-response and finitary Streett games. IST Austria, 2009.
View | Files available | DOI
 
[60]
2009 | Conference Paper | IST-REx-ID: 3503   OA
K. Chatterjee and T. A. Henzinger, “Probabilistic systems with limsup and liminf objectives,” presented at the ILC: Infinity in Logic and Computation, 2009, vol. 5489, pp. 32–45.
View | DOI | Download (ext.)
 
[59]
2009 | Journal Article | IST-REx-ID: 3870   OA
K. Chatterjee, T. A. Henzinger, and F. Horn, “Finitary winning in omega-regular games,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 1, 2009.
View | Files available | DOI
 
[58]
2009 | Conference Paper | IST-REx-ID: 4544   OA
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Termination criteria for solving concurrent safety and reachability games,” presented at the SODA: Symposium on Discrete Algorithms, 2009, pp. 197–206.
View | Files available | DOI | Download (ext.)
 
[57]
2009 | Technical Report | IST-REx-ID: 5395   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, Qualitative analysis of partially-observable Markov decision processes. IST Austria, 2009.
View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3876
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: complexity and robustness,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2008, vol. 5215, pp. 124–140.
View | Files available | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3504
K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game metrics,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2008, vol. 2, pp. 107–118.
View | Files available | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3877
K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Environment assumptions for synthesis,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201, pp. 147–161.
View | DOI
 
[53]
2008 | Book Chapter | IST-REx-ID: 3872
K. Chatterjee and T. A. Henzinger, “Value iteration,” in 25 Years in Model Checking, vol. 5000, Springer, 2008, pp. 107–138.
View | DOI
 
[52]
2008 | Journal Article | IST-REx-ID: 4534
K. Chatterjee and T. A. Henzinger, “Reduction of stochastic parity to stochastic mean-payoff games,” Information Processing Letters, vol. 106, no. 1, pp. 1–7, 2008.
View | DOI | Download (ext.)
 
[51]
2008 | Conference Paper | IST-REx-ID: 4546
K. Chatterjee et al., “Logical reliability of interacting real-time tasks,” presented at the DATE: Design, Automation and Test in Europe, 2008, pp. 909–914.
View | DOI | Download (ext.)
 
[50]
2008 | Conference Paper | IST-REx-ID: 3501
B. T. Adler, K. Chatterjee, L. De Alfaro, M. Faella, I. Pye, and V. Raman, “Assigning trust to Wikipedia content,” presented at the WikiSym: International Symposium on Wikis, 2008.
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3873
K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Controller synthesis with budget constraints,” presented at the HSCC: Hybrid Systems - Computation and Control, 2008, vol. 4981, pp. 72–86.
View | DOI
 
[48]
2008 | Conference Paper | IST-REx-ID: 3878   OA
K. Chatterjee, L. De Alfaro, and R. Majumdar, “The complexity of coverage,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, 2008, vol. 5356, pp. 91–106.
View | DOI | Download (ext.)
 
[47]
2008 | Conference Paper | IST-REx-ID: 3880
D. Berwanger, K. Chatterjee, L. Doyen, T. A. Henzinger, and S. Raje, “Strategy construction for parity games with imperfect information,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201, pp. 325–339.
View | Files available | DOI
 
[46]
2008 | Conference Paper | IST-REx-ID: 3502
K. Chatterjee, L. De Alfaro, and I. Pye, “Robust content-driven reputation,” presented at the AISec: Artificial Intelligence and Security, 2008, pp. 33–42.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3874
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Trading infinite memory for uniform randomness in timed games,” presented at the HSCC: Hybrid Systems - Computation and Control, 2008, vol. 4981, pp. 87–100.
View | DOI
 
[44]
2008 | Conference Paper | IST-REx-ID: 3879
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” presented at the CSL: Computer Science Logic, 2008, vol. 5213, pp. 385–400.
View | DOI
 
[43]
2008 | Journal Article | IST-REx-ID: 4548
K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Stochastic limit-average games are in EXPTIME,” International Journal of Game Theory, vol. 37, no. 2, pp. 219–234, 2008.
View | DOI | Download (ext.)
 
[42]
2008 | Conference Paper | IST-REx-ID: 3875
K. Chatterjee, T. A. Henzinger, and K. Sen, “Model-checking omega-regular properties of interval Markov chains,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2008, vol. 4962, pp. 302–317.
View | DOI
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
K. Chatterjee, T. A. Henzinger, and N. Piterman, “Generalized parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007, vol. 4423, pp. 153–167.
View | DOI
 
[40]
2007 | Conference Paper | IST-REx-ID: 3884
K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” presented at the CONCUR: Concurrency Theory, 2007, vol. 4703, pp. 59–73.
View | Files available | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3885
K. Chatterjee, “Optimal strategy synthesis in stochastic Müller games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007, vol. 4423, pp. 138–152.
View | DOI
 
[38]
2007 | Journal Article | IST-REx-ID: 4547
K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” Logical Methods in Computer Science, vol. 3, no. 184, pp. 1–23, 2007.
View | DOI
 
[37]
2007 | Thesis | IST-REx-ID: 4559
K. Chatterjee, Stochastic ω-Regular Games. University of California, Berkeley, 2007, pp. 1–247.
View | Download (ext.)
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
K. Chatterjee, “Stochastic Müller games are PSPACE-complete,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2007, vol. 4855, pp. 436–448.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3881
L. De Alfaro, K. Chatterjee, M. Faella, and A. Legay, “Qualitative logics and equivalences for probabilistic systems,” presented at the QEST: Quantitative Evaluation of Systems, 2007, pp. 237–248.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 3887
K. Chatterjee, “Markov decision processes with multiple long-run average objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2007, vol. 4855, pp. 473–484.
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 3882
K. Chatterjee, “Concurrent games with tail objectives,” Theoretical Computer Science, vol. 388, no. 1–3, pp. 181–198, 2007.
View | DOI
 
[32]
2007 | Conference Paper | IST-REx-ID: 4537
K. Chatterjee and T. A. Henzinger, “Assume-guarantee synthesis,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2007, vol. 4424, pp. 261–275.
View | DOI
 
[31]
2006 | Conference Paper | IST-REx-ID: 3888
K. Chatterjee and T. A. Henzinger, “Strategy improvement for stochastic Rabin and Streett games,” presented at the CONCUR: Concurrency Theory, 2006, vol. 4137, pp. 375–389.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3890
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “The complexity of quantitative concurrent parity games,” presented at the SODA: Symposium on Discrete Algorithms, 2006, pp. 678–687.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 4552
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability games,” presented at the QEST: Quantitative Evaluation of Systems, 2006, pp. 291–300.
View | DOI
 
[28]
2006 | Conference Paper | IST-REx-ID: 4538
K. Chatterjee and T. A. Henzinger, “Strategy improvement and randomized subexponential algorithms for stochastic parity games,” presented at the STACS: Theoretical Aspects of Computer Science, 2006, vol. 3884, pp. 512–523.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3500
K. Chatterjee, T. A. Henzinger, and N. Piterman, “Algorithms for Büchi Games,” presented at the GDV: Games in Design and Verification, 2006.
View | Download (ext.)
 
[26]
2006 | Conference Paper | IST-REx-ID: 3889
K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 287–302.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3891
K. Chatterjee, “Concurrent games with tail objectives,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 256–270.
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
K. Chatterjee and T. A. Henzinger, “Finitary winning in omega-regular games,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2006, vol. 3920, pp. 257–271.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 3449
K. Chatterjee, R. Jagadeesan, and C. Pitcher, “Games for controls,” presented at the CSF: Computer Security Foundations, 2006, pp. 70–82.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 3499
K. Chatterjee, “Nash equilibrium for upward-closed objectives,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 271–286.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Games with secure equilibria,” Theoretical Computer Science, vol. 365, no. 1–2, pp. 67–82, 2006.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
K. Chatterjee, L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “Compositional quantitative reasoning,” presented at the QEST: Quantitative Evaluation of Systems, 2006, pp. 179–188.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4551
K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Markov decision processes with multiple objectives,” presented at the STACS: Theoretical Aspects of Computer Science, 2006, vol. 3884, pp. 325–336.
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 4557
K. Chatterjee, T. A. Henzinger, R. Jhala, and R. Majumdar, “Counterexample-guided planning,” presented at the UAI: Uncertainty in Artificial Intelligence, 2005, pp. 104–111.
View | Download (ext.)
 
[17]
2005 | Conference Paper | IST-REx-ID: 3896
K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “Complexity of compositional model checking of computation tree logic on simple structures,” presented at the IWDC: International Workshop on Distributed Computing , 2005, vol. 3326, pp. 89–102.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 4541
K. Chatterjee and T. A. Henzinger, “Semiperfect-information games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2005, vol. 3821, pp. 1–18.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4553
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “The complexity of stochastic Rabin and Streett games,” presented at the ICALP: Automata, Languages and Programming, 2005, vol. 3580, pp. 878–890.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4560
A. Chakrabarti, K. Chatterjee, T. A. Henzinger, O. Kupferman, and R. Majumdar, “Verifying quantitative properties using bound functions,” presented at the CHARME: Correct Hardware Design and Verification Methods, 2005, vol. 3725, pp. 50–64.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 3892
K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Games with secure equilibria,” presented at the FMCO: Formal Methods for Components and Objects, 2005, vol. 3657, pp. 141–161.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4554
K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Mean-payoff parity games,” presented at the LICS: Logic in Computer Science, 2005, pp. 178–187.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3893
K. Chatterjee, “Two-player nonzero-sum ω-regular games,” presented at the CONCUR: Concurrency Theory, 2005, vol. 3653, pp. 413–427.
View | DOI
 
[10]
2004 | Conference Paper | IST-REx-ID: 3895
K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Games with secure equilibria,” presented at the LICS: Logic in Computer Science, 2004, pp. 160–169.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 4558
K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Quantitative stochastic parity games,” presented at the SODA: Symposium on Discrete Algorithms, 2004, pp. 121–130.
View
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Trading memory for randomness,” presented at the QEST: Quantitative Evaluation of Systems, 2004, pp. 206–217.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 3894
K. Chatterjee, R. Majumdar, and M. Jurdziński, “On Nash equilibria in stochastic games,” presented at the CSL: Computer Science Logic, 2004, vol. 3210, pp. 26–40.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” Information and Computation, vol. 194, no. 2, pp. 144–174, 2004.
View | DOI
 
[5]
2003 | Journal Article | IST-REx-ID: 3593
K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “A branching time temporal framework for quantitative reasoning,” Journal of Automated Reasoning, vol. 30, no. 2, pp. 205–232, 2003.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3897
K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Simple stochastic parity games,” presented at the CSL: Computer Science Logic, 2003, vol. 2803, pp. 100–113.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3898
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” presented at the SAS: Static Analysis Symposium, 2003, vol. 2694, pp. 109–126.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
S. Mallick, K. Chatterjee, A. Merchant, and P. Dasgupta, “Implementation of shape grammar for plan analysis,” presented at the IT-Built: Information Technology For Built Environment, 2002.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “Weighted quantified computation tree logic,” presented at the CIT: Conference on Information Technology, 2001.
View
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

347 Publications

Mark all

[347]
2019 | Conference Paper | IST-REx-ID: 6490
K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 400–408.
View | DOI
 
[346]
2019 | Conference Paper | IST-REx-ID: 6887   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140, p. 7.
View | Files available | DOI
 
[345]
2019 | Conference Paper | IST-REx-ID: 5948
H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,” vol. 11388. Springer, pp. 468–490, 2019.
View | DOI
 
[344]
2019 | Conference Paper | IST-REx-ID: 6175   OA
P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019), Phoenix, AZ, United States, 2019, pp. 204–220.
View | Files available | DOI | arXiv
 
[343]
2019 | Conference Paper | IST-REx-ID: 6889   OA
K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140, p. 6.
View | Files available | DOI
 
[342]
2019 | Conference Paper | IST-REx-ID: 6942   OA
P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman, “Strategy representation by decision trees with linear classifiers,” in 16th International Conference on Quantitative Evaluation of Systems, Glasgow, United Kingdom, 2019, vol. 11785, pp. 109–128.
View | DOI | Download (ext.) | arXiv
 
[341]
2019 | Journal Article | IST-REx-ID: 6380   OA
K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, p. 53, 2019.
View | Files available | DOI
 
[340]
2019 | Conference Paper | IST-REx-ID: 6378   OA
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 374–381.
View | Files available | DOI
 
[339]
2019 | Conference Paper | IST-REx-ID: 6462   OA
G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger, “Run-time optimization for learned controllers through quantitative games,” in 31st International Conference on Computer-Aided Verification, New York, NY, United States, 2019, vol. 11561, pp. 630–649.
View | Files available | DOI
 
[338]
2019 | Conference Paper | IST-REx-ID: 6056   OA
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019, p. 8751326.
View | DOI | Download (ext.) | arXiv
 
[337]
2019 | Conference Paper | IST-REx-ID: 6885   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140, p. 27.
View | Files available | DOI
 
[336]
2019 | Conference Paper | IST-REx-ID: 6780   OA
M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Athens, Greece.
View | Files available | Download (ext.) | arXiv
 
[335]
2019 | Journal Article | IST-REx-ID: 6836
O. P. Hauser, C. Hilbe, K. Chatterjee, and M. A. Nowak, “Social dilemmas among unequals,” Nature, vol. 572, no. 7770, pp. 524–527, 2019.
View | Files available | DOI
 
[334]
2018 | Conference Paper | IST-REx-ID: 143   OA
T. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033, pp. 185–194.
View | DOI | Download (ext.)
 
[333]
2018 | Journal Article | IST-REx-ID: 198   OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140, 2018.
View | Files available | DOI
 
[332]
2018 | Conference Paper | IST-REx-ID: 35   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.
View | Download (ext.) | arXiv
 
[331]
2018 | Book Chapter | IST-REx-ID: 59
R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Modeling Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.
View | DOI
 
[330]
2018 | Conference Paper | IST-REx-ID: 66   OA
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies.,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118, p. 11.
View | Files available | DOI | Download (ext.) | arXiv
 
[329]
2018 | Conference Paper | IST-REx-ID: 24   OA
K. Chatterjee, A. Elgyütt, P. Novotny, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.
View | DOI | Download (ext.) | arXiv
 
[328]
2018 | Conference Paper | IST-REx-ID: 310   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, USA, 2018, pp. 2341–2356.
View | DOI | Download (ext.) | arXiv
 
[327]
2018 | Journal Article | IST-REx-ID: 6009   OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, p. 9, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
[326]
2018 | Journal Article | IST-REx-ID: 5993   OA
K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, p. 7, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
[325]
2018 | Conference Paper | IST-REx-ID: 6340   OA
A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.
View | Files available | arXiv
 
[324]
2018 | Conference Paper | IST-REx-ID: 79   OA
S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.
View | DOI | Download (ext.) | arXiv
 
[323]
2018 | Journal Article | IST-REx-ID: 738   OA
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1, pp. 166–207, 2018.
View | Files available | DOI
 
[322]
2018 | Journal Article | IST-REx-ID: 454   OA
J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” Nature Communications, vol. 9, no. 1, p. 555, 2018.
View | Files available | DOI
 
[321]
2018 | Book Chapter | IST-REx-ID: 86
K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.
View | DOI
 
[320]
2018 | Journal Article | IST-REx-ID: 157
C. Hilbe, Š. Šimsa, K. Chatterjee, and M. Nowak, “Evolution of cooperation in stochastic games,” Nature, vol. 559, no. 7713, pp. 246–249, 2018.
View | Files available | DOI
 
[319]
2018 | Conference Paper | IST-REx-ID: 25
K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.
View | DOI
 
[318]
2018 | Conference Paper | IST-REx-ID: 311   OA
K. Chatterjee, A. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.
View | Files available | DOI
 
[317]
2018 | Conference Paper | IST-REx-ID: 141   OA
K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.
View | Files available | DOI
 
[316]
2018 | Journal Article | IST-REx-ID: 2   OA
C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private noisy and incomplete information,” PNAS, vol. 115, no. 48, pp. 12241–12246, 2018.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[315]
2018 | Conference Paper | IST-REx-ID: 297   OA
T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.
View | Files available | DOI
 
[314]
2018 | Conference Paper | IST-REx-ID: 325   OA
S. Agrawal, K. Chatterjee, and P. Novotny, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.
View | DOI | Download (ext.) | arXiv
 
[313]
2018 | Conference Paper | IST-REx-ID: 34   OA
K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.
View | Download (ext.) | arXiv
 
[312]
2018 | Journal Article | IST-REx-ID: 419
C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” Nature Human Behaviour, vol. 2, pp. 469–477, 2018.
View | Files available | DOI
 
[311]
2018 | Conference Paper | IST-REx-ID: 5679   OA
M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.
View | DOI | Download (ext.) | arXiv
 
[310]
2018 | Preprint | IST-REx-ID: 5977   OA
K. Chatterjee, H. Fu, A. Goharshady, and N. Okati, “Computational Approaches for Stochastic Shortest Path on Succinct MDPs,” ArXiv. ArXiv.
View | Download (ext.) | arXiv
 
[309]
2018 | Journal Article | IST-REx-ID: 5751   OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1, p. 71, 2018.
View | Files available | DOI
 
[308]
2017 | Journal Article | IST-REx-ID: 681   OA
K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for omega-regular games,” Information and Computation, vol. 254, pp. 296–315, 2017.
View | DOI | Download (ext.)
 
[307]
2017 | Journal Article | IST-REx-ID: 744
T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” Journal of Theoretical Biology, vol. 433, pp. 64–72, 2017.
View | DOI
 
[306]
2017 | Journal Article | IST-REx-ID: 465   OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
[305]
2017 | Journal Article | IST-REx-ID: 1407   OA
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, pp. 230–253, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 
[304]
2017 | Journal Article | IST-REx-ID: 1065   OA
K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” Information Processing Letters, vol. 122, pp. 25–29, 2017.
View | Files available | DOI
 
[303]
2017 | Conference Paper | IST-REx-ID: 1009   OA
K. Chatterjee, P. Novotny, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.
View | Download (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 1011   OA
K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “ Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.
View | DOI | Download (ext.)
 
[301]
2017 | Journal Article | IST-REx-ID: 1080   OA
J. Reiter et al., “Reconstructing metastatic seeding patterns of human cancers,” Nature Communications, vol. 8, 2017.
View | Files available | DOI
 
[300]
2017 | Journal Article | IST-REx-ID: 1066
K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” Information and Computation, vol. 254, no. 2, pp. 143–166, 2017.
View | Files available | DOI
 
[299]
2017 | Technical Report | IST-REx-ID: 5455   OA
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
View | Files available | DOI
 
[298]
2017 | Book Chapter | IST-REx-ID: 625
K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.
View | DOI
 
[297]
2017 | Journal Article | IST-REx-ID: 719
K. Chatterjee and R. Ehlers, “Special issue: Synthesis and SYNT 2014,” Acta Informatica, vol. 54, no. 6, pp. 543–544, 2017.
View | DOI
 
[296]
2017 | Journal Article | IST-REx-ID: 466   OA
K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2, p. 15, 2017.
View | Files available | DOI
 
[295]
2017 | Journal Article | IST-REx-ID: 512   OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1, p. 82, 2017.
View | Files available | DOI
 
[294]
2017 | Journal Article | IST-REx-ID: 1294   OA
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” Journal of Computer and System Sciences, vol. 84, pp. 144–170, 2017.
View | Files available | DOI
 
[293]
2017 | Conference Paper | IST-REx-ID: 1194   OA
K. Chatterjee, P. Novotny, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160.
View | DOI | Download (ext.)
 
[292]
2017 | Technical Report | IST-REx-ID: 5456   OA
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
View | Files available | DOI
 
[291]
2017 | Conference Paper | IST-REx-ID: 551   OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
[290]
2017 | Conference Paper | IST-REx-ID: 645   OA
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.
View | DOI | Download (ext.)
 
[289]
2017 | Journal Article | IST-REx-ID: 671   OA
C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” PNAS, vol. 114, no. 18, pp. 4715–4720, 2017.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[288]
2017 | Journal Article | IST-REx-ID: 467   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, p. 31, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 
[287]
2017 | Conference Paper | IST-REx-ID: 552   OA
K. Chatterjee, M. Henzinger, and A. Svozil, “Faster algorithms for mean payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
[286]
2017 | Conference Paper | IST-REx-ID: 639   OA
K. Chatterjee, H. Fu, and A. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.
View | DOI | Download (ext.)
 
[285]
2017 | Journal Article | IST-REx-ID: 653
A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3, pp. 358–366, 2017.
View | DOI
 
[284]
2017 | Journal Article | IST-REx-ID: 684   OA
K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” Journal of Symbolic Logic, vol. 82, no. 2, pp. 420–452, 2017.
View | DOI | Download (ext.)
 
[283]
2017 | Conference Paper | IST-REx-ID: 711   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85.
View | Files available | DOI
 
[282]
2017 | Journal Article | IST-REx-ID: 716
K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5, p. 34, 2017.
View | DOI
 
[281]
2017 | Conference Paper | IST-REx-ID: 949   OA
K. Chatterjee, A. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.
View | Files available | DOI
 
[280]
2017 | Journal Article | IST-REx-ID: 464   OA
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
[279]
2017 | Conference Paper | IST-REx-ID: 553   OA
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI | Download (ext.)
 
[278]
2017 | Conference Paper | IST-REx-ID: 628   OA
K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139.
View | DOI | Download (ext.)
 
[277]
2017 | Conference Paper | IST-REx-ID: 6519   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82, p. 18.
View | Files available | DOI
 
[276]
2017 | Research Data | IST-REx-ID: 5559
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , Strong amplifiers of natural selection. IST Austria, 2017.
View | Files available | DOI
 
[275]
2017 | Journal Article | IST-REx-ID: 717
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” Journal of Computer and System Sciences, vol. 88, pp. 236–259, 2017.
View | Files available | DOI | Download (ext.)
 
[274]
2016 | Conference Paper | IST-REx-ID: 1166
K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.
View | Files available
 
[273]
2016 | Conference Paper | IST-REx-ID: 1438
K. Chatterjee, H. Fu, P. Novotny, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.
View | Files available | DOI | Download (ext.) | arXiv
 
[272]
2016 | Conference Paper | IST-REx-ID: 478   OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.
View | Files available | DOI
 
[271]
2016 | Conference Paper | IST-REx-ID: 480   OA
K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.
View | DOI | Download (ext.)
 
[270]
2016 | Journal Article | IST-REx-ID: 1477
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5, pp. 878–911, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[269]
2016 | Conference Paper | IST-REx-ID: 1182   OA
K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.
View | Files available | Download (ext.)
 
[268]
2016 | Conference Paper | IST-REx-ID: 1245
V. Pandey and K. Chatterjee, “Game-theoretic models identify useful principles for peer collaboration in online learning platforms,” in Proceedings of the ACM Conference on Computer Supported Cooperative Work, San Francisco, CA, USA, 2016, vol. 26, no. Februar-2016, pp. 365–368.
View | DOI
 
[267]
2016 | Conference Paper | IST-REx-ID: 1327   OA
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotny, “Stochastic shortest path with energy constraints in POMDPs,” in Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, Singapore, 2016, pp. 1465–1466.
View | Download (ext.)
 
[266]
2016 | Journal Article | IST-REx-ID: 1529
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234, pp. 26–48, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[265]
2016 | Technical Report | IST-REx-ID: 5451   OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.
View | Files available | DOI
 
[264]
2016 | Technical Report | IST-REx-ID: 5449
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.
View | Files available | DOI
 
[263]
2016 | Conference Paper | IST-REx-ID: 1068   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.
View | Files available | DOI
 
[262]
2016 | Conference Paper | IST-REx-ID: 1070   OA
K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.
View | Files available | DOI
 
[261]
2016 | Conference Paper | IST-REx-ID: 1138   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative automata under probabilistic semantics,” in Proceedings of the 31st Annual ACM/IEEE Symposium, New York, NY, USA, 2016, pp. 76–85.
View | DOI | Download (ext.)
 
[260]
2016 | Conference Paper | IST-REx-ID: 1140   OA
K. Chatterjee, W. Dvoák, M. Henzinger, and V. Loitzenbauer, “Model and objective separation with conditional lower bounds disjunction is harder than conjunction,” in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York, NY, USA, 2016, pp. 197–206.
View | DOI | Download (ext.)
 
[259]
2016 | Conference Paper | IST-REx-ID: 1335   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative monitor automata,” presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom, 2016, vol. 9837, pp. 23–38.
View | DOI | Download (ext.)
 
[258]
2016 | Technical Report | IST-REx-ID: 5445   OA
K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
View | Files available | DOI
 
[257]
2016 | Technical Report | IST-REx-ID: 5452
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
View | Files available | DOI
 
[256]
2016 | Conference Paper | IST-REx-ID: 1090   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland, 2016, vol. 58.
View | Files available | DOI
 
[255]
2016 | Conference Paper | IST-REx-ID: 1324
K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, London, United Kingdom, 2016, vol. 2016–January, pp. 88–96.
View | Download (ext.)
 
[254]
2016 | Conference Paper | IST-REx-ID: 1386   OA
K. Chatterjee, H. Fu, and A. Goharshady, “Termination analysis of probabilistic programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9779, pp. 3–22.
View | DOI | Download (ext.)
 
[253]
2016 | Technical Report | IST-REx-ID: 5453   OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
View | Files available | DOI
 
[252]
2016 | Conference Paper | IST-REx-ID: 1071
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
View | Files available | DOI
 
[251]
2016 | Conference Paper | IST-REx-ID: 1437
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
View | Files available | DOI | Download (ext.) | arXiv
 
[250]
2015 | Conference Paper | IST-REx-ID: 1609   OA
K. Chatterjee, L. Doyen, and M. Vardi, “The complexity of synthesis from probabilistic components,” vol. 9135. Springer, pp. 108–120, 2015.
View | DOI | Download (ext.)
 
[249]
2015 | Journal Article | IST-REx-ID: 1673   OA
B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181, p. 20150114, 2015.
View | Files available | DOI
 
[248]
2015 | Conference Paper | IST-REx-ID: 1820   OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.
View | Files available | Download (ext.) | arXiv
 
[247]
2015 | Journal Article | IST-REx-ID: 1856
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1, 2015.
View | Files available | DOI | Download (ext.)
 
[246]
2015 | Journal Article | IST-REx-ID: 1731
K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12, pp. 3–16, 2015.
View | Files available | DOI | Download (ext.)
 
[245]
2015 | Conference Paper | IST-REx-ID: 1661
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July, p. 7174888.
View | Files available | DOI | Download (ext.)
 
[244]
2015 | Journal Article | IST-REx-ID: 523   OA
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” Information and Computation, vol. 242, no. 6, pp. 25–52, 2015.
View | Files available | DOI | Download (ext.)
 
[243]
2015 | Technical Report | IST-REx-ID: 5430
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View | Files available | DOI
 
[242]
2015 | Journal Article | IST-REx-ID: 1604
K. Chatterjee, A. Pavlogiannis, and Y. Velner, “Quantitative interprocedural analysis,” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1, pp. 539–551, 2015.
View | Files available | DOI
 
[241]
2015 | Technical Report | IST-REx-ID: 5435
K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
View | Files available | DOI
 
[240]
2015 | Journal Article | IST-REx-ID: 1559   OA
R. Ibsen-Jensen, K. Chatterjee, and M. Nowak, “Computational complexity of ecological and evolutionary spatial dynamics,” PNAS, vol. 112, no. 51, pp. 15636–15641, 2015.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[239]
2015 | Journal Article | IST-REx-ID: 1624   OA
A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” Scientific Reports, vol. 5, 2015.
View | Files available | DOI
 
[238]
2015 | Journal Article | IST-REx-ID: 1698   OA
Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” Information and Computation, vol. 241, no. 4, pp. 177–196, 2015.
View | DOI | Download (ext.)
 
[237]
2015 | Journal Article | IST-REx-ID: 1681   OA
T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” Games, vol. 6, no. 4, pp. 413–437, 2015.
View | Files available | DOI
 
[236]
2015 | Conference Paper | IST-REx-ID: 1838   OA
R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee synthesis for concurrent reactive programs with partial information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom, 2015, vol. 9035, pp. 517–532.
View | DOI | Download (ext.)
 
[235]
2015 | Journal Article | IST-REx-ID: 524
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6, pp. 2–24, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[234]
2015 | Conference Paper | IST-REx-ID: 1732
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5443   OA
K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.
View | Files available | DOI
 
[232]
2015 | Technical Report | IST-REx-ID: 5431   OA
K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.
View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5429
K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
View | Files available | DOI
 
[230]
2015 | Technical Report | IST-REx-ID: 5436
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.
View | Files available | DOI
 
[229]
2015 | Journal Article | IST-REx-ID: 1694
K. Chatterjee and V. Prabhu, “Quantitative temporal simulation and refinement distances for timed systems,” IEEE Transactions on Automatic Control, vol. 60, no. 9, pp. 2291–2306, 2015.
View | DOI
 
[228]
2015 | Conference Paper | IST-REx-ID: 1839   OA
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer, pp. 181–187, 2015.
View | DOI | Download (ext.)
 
[227]
2015 | Journal Article | IST-REx-ID: 2034   OA
B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” Information Processing Letters, vol. 115, no. 1, pp. 52–59, 2015.
View | DOI | Download (ext.)
 
[226]
2015 | Journal Article | IST-REx-ID: 1598
K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3, pp. 71–89, 2015.
View | Files available | DOI | Download (ext.)
 
[225]
2015 | Technical Report | IST-REx-ID: 5437   OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View | Files available | DOI
 
[224]
2015 | Technical Report | IST-REx-ID: 5444   OA
J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.
View | Files available | DOI
 
[223]
2015 | Conference Paper | IST-REx-ID: 1714
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.
View | Files available | DOI
 
[222]
2015 | Technical Report | IST-REx-ID: 5432
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 
[221]
2015 | Conference Paper | IST-REx-ID: 1656
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July, p. 7174926.
View | Files available | DOI | arXiv
 
[220]
2015 | Journal Article | IST-REx-ID: 1873   OA
K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” Artificial Intelligence, vol. 221, pp. 46–72, 2015.
View | DOI | Download (ext.) | arXiv
 
[219]
2015 | Conference Paper | IST-REx-ID: 1481
U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” presented at the AAAI: Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752.
View | Files available | Download (ext.)
 
[218]
2015 | Journal Article | IST-REx-ID: 1501
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” Formal Methods in System Design, vol. 47, no. 2, pp. 230–264, 2015.
View | Files available | DOI | Download (ext.)
 
[217]
2015 | Journal Article | IST-REx-ID: 1602
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1, pp. 97–109, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[216]
2015 | Conference Paper | IST-REx-ID: 1607
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.
View | Files available | DOI | Download (ext.)
 
[215]
2015 | Technical Report | IST-REx-ID: 5440
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 
[214]
2015 | Technical Report | IST-REx-ID: 5438
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
View | Files available | DOI
 
[213]
2015 | Conference Paper | IST-REx-ID: 1657
K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.
View | Files available | DOI
 
[212]
2015 | Conference Paper | IST-REx-ID: 1691
M. Svoreňová et al., “Temporal logic motion planning using POMDPs with parity objectives: Case study paper,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 233–238.
View | DOI
 
[211]
2015 | Journal Article | IST-REx-ID: 1709   OA
J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological auctions with multiple rewards,” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 282, no. 1812, 2015.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[210]
2015 | Conference Paper | IST-REx-ID: 1603
T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.
View | Files available | DOI | Download (ext.)
 
[209]
2015 | Technical Report | IST-REx-ID: 5441
K. Chatterjee, R. Ibsen-Jensen, A. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
View | Files available | DOI
 
[208]
2015 | Conference Paper | IST-REx-ID: 1610
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” vol. 9135, no. Part II. Springer, pp. 121–133, 2015.
View | Files available | DOI
 
[207]
2015 | Conference Paper | IST-REx-ID: 1689
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.
View | Files available | DOI | Download (ext.)
 
[206]
2014 | Journal Article | IST-REx-ID: 1375   OA
K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” Theoretical Computer Science, vol. 547, no. C, pp. 104–116, 2014.
View | DOI | Download (ext.)
 
[205]
2014 | Journal Article | IST-REx-ID: 2234   OA
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” Logical Methods in Computer Science, vol. 10, no. 1, 2014.
View | Files available | DOI | Download (ext.)
 
[204]
2014 | Journal Article | IST-REx-ID: 535   OA
K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3, pp. 457–492, 2014.
View | DOI | Download (ext.)
 
[203]
2014 | Technical Report | IST-REx-ID: 5423   OA
K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria, 2014.
View | Files available | DOI
 
[202]
2014 | Technical Report | IST-REx-ID: 5428   OA
K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014.
View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2063
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.
View | Files available | DOI
 
[200]
2014 | Journal Article | IST-REx-ID: 2716   OA
K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4, pp. 129–163, 2014.
View | DOI | Download (ext.)
 
[199]
2014 | Journal Article | IST-REx-ID: 2141
K. Chatterjee and M. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3, 2014.
View | Files available | DOI | Download (ext.)
 
[198]
2014 | Journal Article | IST-REx-ID: 2038
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, p. 27, 2014.
View | Files available | DOI
 
[197]
2014 | Conference Paper | IST-REx-ID: 2216
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.
View | Files available | DOI | Download (ext.)
 
[196]
2014 | Technical Report | IST-REx-ID: 5412
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[195]
2014 | Technical Report | IST-REx-ID: 5424
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View | Files available | DOI
 
[194]
2014 | Journal Article | IST-REx-ID: 2211
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, p. 16, 2014.
View | Files available | DOI | Download (ext.) | arXiv
 
[193]
2014 | Conference Paper | IST-REx-ID: 1903
K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.
View | Files available | DOI
 
[192]
2014 | Conference Paper | IST-REx-ID: 1853
S. Jha, S. Tripakis, S. Seshia, and K. Chatterjee, “Game theoretic secure localization in wireless sensor networks,” presented at the IOT: Internet of Things, Cambridge, USA, 2014, pp. 85–90.
View | DOI
 
[191]
2014 | Conference Paper | IST-REx-ID: 2027   OA
T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
View | DOI | Download (ext.)
 
[190]
2014 | Conference Paper | IST-REx-ID: 2212
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
View | Files available | DOI
 
[189]
2014 | Technical Report | IST-REx-ID: 5413
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[188]
2014 | Technical Report | IST-REx-ID: 5418   OA
K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria, 2014.
View | Files available | DOI
 
[187]
2014 | Technical Report | IST-REx-ID: 5420   OA
K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.
View | Files available | DOI
 
[186]
2014 | Journal Article | IST-REx-ID: 2039   OA
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9, 2014.
View | Files available | DOI
 
[185]
2014 | Conference Paper | IST-REx-ID: 2054
K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.
View | Files available | DOI
 
[184]
2014 | Conference Paper | IST-REx-ID: 2213
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
View | Files available | DOI | Download (ext.) | arXiv
 
[183]
2014 | Conference Paper | IST-REx-ID: 2162
K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
View | Files available | DOI | Download (ext.) | arXiv
 
[182]
2014 | Technical Report | IST-REx-ID: 5426   OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View | Files available | DOI
 
[181]
2014 | Technical Report | IST-REx-ID: 5419   OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
View | Files available | DOI
 
[180]
2014 | Technical Report | IST-REx-ID: 5414   OA
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5421   OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.
View | Files available | DOI
 
[178]
2014 | Journal Article | IST-REx-ID: 2187   OA
R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4, pp. 193–220, 2014.
View | Files available | DOI
 
[177]
2014 | Conference Paper | IST-REx-ID: 2163
K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.
View | Files available | DOI | Download (ext.) | arXiv
 
[176]
2014 | Technical Report | IST-REx-ID: 5427   OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
View | Files available | DOI
 
[175]
2014 | Technical Report | IST-REx-ID: 5415
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.
View | Files available | DOI
 
[174]
2013 | Journal Article | IST-REx-ID: 2816   OA
I. Božić et al., “Evolutionary dynamics of cancer in response to targeted combination therapy,” eLife, vol. 2, 2013.
View | Files available | DOI
 
[173]
2013 | Journal Article | IST-REx-ID: 2854   OA
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” Journal of Computer and System Sciences, vol. 79, no. 5, pp. 640–657, 2013.
View | Files available | DOI
 
[172]
2013 | Technical Report | IST-REx-ID: 5404   OA
K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
View | Files available | DOI
 
[171]
2013 | Technical Report | IST-REx-ID: 5409   OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
View | Files available | DOI
 
[170]
2013 | Journal Article | IST-REx-ID: 2247   OA
B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma ,” PLoS One, vol. 8, no. 12, 2013.
View | Files available | DOI
 
[169]
2013 | Conference (Editor) | IST-REx-ID: 2292
K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854.
View | DOI
 
[168]
2013 | Conference Paper | IST-REx-ID: 2444   OA
K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.
View | DOI | Download (ext.) | arXiv
 
[167]
2013 | Journal Article | IST-REx-ID: 2824
K. Chatterjee and V. Prabhu, “Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems,” Information and Computation, vol. 228–229, pp. 83–119, 2013.
View | DOI
 
[166]
2013 | Journal Article | IST-REx-ID: 2831   OA
K. Chatterjee, M. Henzinger, M. Joglekar, and N. Shah, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” Formal Methods in System Design, vol. 42, no. 3, pp. 301–327, 2013.
View | DOI | Download (ext.) | arXiv
 
[165]
2013 | Journal Article | IST-REx-ID: 2836   OA
K. Chatterjee and V. Raman, “Assume-guarantee synthesis for digital contract signing,” Formal Aspects of Computing, vol. 26, no. 4, pp. 825–859, 2013.
View | DOI | Download (ext.) | arXiv
 
[164]
2013 | Journal Article | IST-REx-ID: 2817   OA
S. Novak, K. Chatterjee, and M. Nowak, “Density games,” Journal of Theoretical Biology, vol. 334, pp. 26–34, 2013.
View | Files available | DOI
 
[163]
2013 | Technical Report | IST-REx-ID: 5400   OA
K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria, 2013.
View | Files available | DOI
 
[162]
2013 | Conference Paper | IST-REx-ID: 1376
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
View | Files available | DOI
 
[161]
2013 | Technical Report | IST-REx-ID: 5405   OA
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information stochastic mean-payoff parity games. IST Austria, 2013.
View | Files available | DOI
 
[160]
2013 | Conference Paper | IST-REx-ID: 2305
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” in 28th Annual ACM/IEEE Symposium, New Orleans, LA, United States, 2013, pp. 331–340.
View | Files available | DOI | Download (ext.) | arXiv
 
[159]
2013 | Conference Paper | IST-REx-ID: 2329   OA
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.
View | Files available | DOI | Download (ext.) | arXiv
 
[158]
2013 | Conference Paper | IST-REx-ID: 2279
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.
View | Files available | DOI | Download (ext.)
 
[157]
2013 | Technical Report | IST-REx-ID: 5406   OA
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 2820
K. Chatterjee, A. Kößler, and U. Schmid, “Automated analysis of real-time scheduling using graph games,” in Proceedings of the 16th International conference on Hybrid systems: Computation and control, Philadelphia, PA, United States, 2013, pp. 163–172.
View | Files available | DOI
 
[155]
2013 | Conference Paper | IST-REx-ID: 2446   OA
K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.
View | DOI | Download (ext.) | arXiv
 
[154]
2013 | Journal Article | IST-REx-ID: 2814   OA
K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” International Journal of Foundations of Computer Science, vol. 24, no. 2, pp. 165–185, 2013.
View | DOI | Download (ext.) | arXiv
 
[153]
2013 | Conference Paper | IST-REx-ID: 2819   OA
K. Chatterjee and V. Prabhu, “Quantitative timed simulation functions and refinement metrics for real-time systems,” in Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Philadelphia, PA USA, 2013, vol. 1, pp. 273–282.
View | DOI | Download (ext.)
 
[152]
2013 | Technical Report | IST-REx-ID: 5399   OA
J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, TTP: Tool for Tumor Progression. IST Austria, 2013.
View | Files available | DOI
 
[151]
2013 | Journal Article | IST-REx-ID: 2299   OA
Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, pp. 585–601, 2013.
View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 1374   OA
K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196.
View | Files available | DOI
 
[149]
2013 | Conference Paper | IST-REx-ID: 2238
K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.
View | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 3116
K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware resource management,” Formal Methods in System Design, vol. 42, no. 2, pp. 142–174, 2013.
View | DOI
 
[147]
2013 | Conference Paper | IST-REx-ID: 2295
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
View | Files available | DOI
 
[146]
2013 | Technical Report | IST-REx-ID: 5403   OA
K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
View | Files available | DOI
 
[145]
2013 | Conference Paper | IST-REx-ID: 2000
J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,” in Proceedings of 25th Int. Conf. on Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 101–106.
View | Files available | DOI | Download (ext.) | arXiv
 
[144]
2013 | Technical Report | IST-REx-ID: 5410   OA
U. Ahmed, K. Chatterjee, and S. Gulwani, Automatic generation of alternative starting positions for traditional board games. IST Austria, 2013.
View | Files available | DOI
 
[143]
2013 | Technical Report | IST-REx-ID: 5408   OA
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria, 2013.
View | Files available | DOI
 
[142]
2013 | Journal Article | IST-REx-ID: 2858   OA
J. Reiter, I. Božić, B. Allen, K. Chatterjee, and M. Nowak, “The effect of one additional driver mutation on tumor progression,” Evolutionary Applications, vol. 6, no. 1, pp. 34–45, 2013.
View | Files available | DOI
 
[141]
2012 | Conference Paper | IST-REx-ID: 2715   OA
K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 2012, vol. 18, pp. 461–473.
View | Files available | DOI
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936   OA
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.
View | DOI | Download (ext.)
 
[139]
2012 | Journal Article | IST-REx-ID: 3314
K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” International Journal of Foundations of Computer Science, vol. 23, no. 3, pp. 609–625, 2012.
View | DOI
 
[138]
2012 | Conference Paper | IST-REx-ID: 2955   OA
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012, p. 6280436.
View | Files available | DOI | Download (ext.) | arXiv
 
[137]
2012 | Technical Report | IST-REx-ID: 5377
K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.
View | Files available | DOI
 
[136]
2012 | Journal Article | IST-REx-ID: 2848   OA
K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” Journal of Theoretical Biology, vol. 301, pp. 161–173, 2012.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[135]
2012 | Conference Paper | IST-REx-ID: 3252   OA
K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.
View | DOI | Download (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3846   OA
K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” Journal of Computer and System Sciences, vol. 78, no. 2, pp. 394–413, 2012.
View | Files available | DOI
 
[133]
2012 | Conference Paper | IST-REx-ID: 497
K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.
View | Files available | DOI
 
[132]
2012 | Technical Report | IST-REx-ID: 5378   OA
K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.
View | Files available | DOI
 
[131]
2012 | Conference Paper | IST-REx-ID: 3341
K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.
View | Files available | DOI | Download (ext.) | arXiv
 
[130]
2012 | Conference Paper | IST-REx-ID: 2956
K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012, p. 6280438.
View | Files available | DOI
 
[129]
2012 | Journal Article | IST-REx-ID: 3260   OA
K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” Theoretical Population Biology, vol. 81, no. 1, pp. 69–80, 2012.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[128]
2012 | Conference Paper | IST-REx-ID: 2957
K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012, p. 6280437.
View | Files available | DOI | Download (ext.) | arXiv
 
[127]
2012 | Journal Article | IST-REx-ID: 3254
K. Chatterjee, “The complexity of stochastic Müller games,” Information and Computation, vol. 211, pp. 29–48, 2012.
View | DOI | Download (ext.)
 
[126]
2012 | Conference Paper | IST-REx-ID: 3165
K. Chatterjee and M. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.
View | Files available | DOI
 
[125]
2012 | Journal Article | IST-REx-ID: 2972   OA
K. Chatterjee and L. Doyen, “Energy parity games,” Theoretical Computer Science, vol. 458, pp. 49–60, 2012.
View | Files available | DOI | arXiv
 
[124]
2012 | Conference Paper | IST-REx-ID: 2947   OA
K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.
View | DOI | Download (ext.)
 
[123]
2012 | Conference Paper | IST-REx-ID: 3135   OA
B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotny, “Efficient controller synthesis for consumption games with multiple resource types,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.
View | DOI | Download (ext.)
 
[122]
2012 | Journal Article | IST-REx-ID: 3128   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” Formal Methods in System Design, vol. 43, no. 2, pp. 268–284, 2012.
View | Files available | DOI
 
[121]
2012 | Conference Paper | IST-REx-ID: 3255
K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.
View | DOI
 
[120]
2011 | Conference Paper | IST-REx-ID: 3357
K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
View | DOI
 
[119]
2011 | Conference Paper | IST-REx-ID: 3345
K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.
View | Files available | DOI | Download (ext.) | arXiv
 
[118]
2011 | Technical Report | IST-REx-ID: 5384   OA
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
View | Files available | DOI
 
[117]
2011 | Preprint | IST-REx-ID: 3338   OA
K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.
View | Files available | Download (ext.) | arXiv
 
[116]
2011 | Conference Paper | IST-REx-ID: 3346   OA
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
View | DOI | Download (ext.)
 
[115]
2011 | Conference Paper | IST-REx-ID: 3365   OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
View | Files available | DOI
 
[114]
2011 | Journal Article | IST-REx-ID: 3315
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4, 2011.
View | Files available | DOI
 
[113]
2011 | Technical Report | IST-REx-ID: 5385   OA
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.
View | Files available | DOI
 
[112]
2011 | Technical Report | IST-REx-ID: 5380
K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.
View | Files available | DOI
 
[111]
2011 | Preprint | IST-REx-ID: 3339   OA
K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for stochastic games with discounted and long-run average objectives,” arXiv. ArXiv, 2011.
View | Download (ext.) | arXiv
 
[110]
2011 | Conference Paper | IST-REx-ID: 3342   OA
K. Chatterjee, M. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
View | DOI | Download (ext.) | arXiv
 
[109]
2011 | Journal Article | IST-REx-ID: 3354
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 2011.
View | Files available | DOI
 
[108]
2011 | Conference Paper | IST-REx-ID: 3361   OA
P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
View | Files available | DOI
 
[107]
2011 | Technical Report | IST-REx-ID: 5379   OA
K. Chatterjee and M. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
View | Files available | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3366
P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
View | Files available | DOI
 
[105]
2011 | Conference Paper | IST-REx-ID: 3347   OA
K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.
View | DOI | Download (ext.) | arXiv
 
[104]
2011 | Conference Paper | IST-REx-ID: 3316
R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.
View | DOI
 
[103]
2011 | Technical Report | IST-REx-ID: 5381
K. Chatterjee and L. Doyen, Partial-observation stochastic games: How to win when belief fails. IST Austria, 2011.
View | Files available | DOI
 
[102]
2011 | Conference Paper | IST-REx-ID: 3348   OA
K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.
View | DOI | Download (ext.)
 
[101]
2011 | Conference Paper | IST-REx-ID: 3350
K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.
View | DOI
 
[100]
2011 | Conference Paper | IST-REx-ID: 3343   OA
K. Chatterjee and M. Henzinger, “Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, USA, 2011, pp. 1318–1336.
View | DOI | Download (ext.)
 
[99]
2011 | Technical Report | IST-REx-ID: 5382   OA
K. Chatterjee, Robustness of structurally equivalent concurrent parity games. IST Austria, 2011.
View | Files available | DOI
 
[98]
2011 | Technical Report | IST-REx-ID: 5387   OA
K. Chatterjee and L. Doyen, Energy and mean-payoff parity Markov decision processes. IST Austria, 2011.
View | Files available | DOI
 
[97]
2011 | Preprint | IST-REx-ID: 3363   OA
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
View | Download (ext.) | arXiv
 
[96]
2011 | Conference Paper | IST-REx-ID: 3349   OA
K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.
View | DOI | Download (ext.)
 
[95]
2011 | Conference Paper | IST-REx-ID: 3351   OA
K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.
View | DOI | Download (ext.)
 
[94]
2011 | Conference Paper | IST-REx-ID: 3344
K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.
View | DOI
 
[93]
2011 | Conference Paper | IST-REx-ID: 3356
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3864   OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.
View | Files available | DOI | Download (ext.)
 
[91]
2010 | Conference Paper | IST-REx-ID: 3857
K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.
View | Files available | DOI
 
[90]
2010 | Conference Paper | IST-REx-ID: 3852   OA
K. Chatterjee and R. Majumdar, “Discounting in games across time scales,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2010, vol. 25, pp. 22–29.
View | Files available | DOI | arXiv
 
[89]
2010 | Conference Paper | IST-REx-ID: 3853   OA
K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.
View | Files available | DOI
 
[88]
2010 | Conference Paper | IST-REx-ID: 3858
K. Chatterjee and L. Doyen, “The complexity of partial-observation parity games,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.
View | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3865
K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact of change in multi-threaded programs,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307.
View | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3860   OA
K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.
View | Files available | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3854
K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.
View | DOI
 
[84]
2010 | Conference Paper | IST-REx-ID: 3866   OA
R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.
View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3861
K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” Information and Computation, vol. 208, no. 6, pp. 677–693, 2010.
View | Files available | DOI
 
[82]
2010 | Conference Paper | IST-REx-ID: 4388
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.
View | Files available | DOI | Download (ext.) | arXiv
 
[81]
2010 | Conference (Editor) | IST-REx-ID: 3859
K. Chatterjee and T. A. Henzinger, Eds., Formal modeling and analysis of timed systems, vol. 6246. Springer, 2010.
View | Files available | DOI
 
[80]
2010 | Journal Article | IST-REx-ID: 3862   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 4, p. 23, 2010.
View | Files available | DOI
 
[79]
2010 | Conference Paper | IST-REx-ID: 3855
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.
View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” Logical Methods in Computer Science, vol. 6, no. 3, pp. 1–23, 2010.
View | Files available | DOI
 
[77]
2010 | Conference Paper | IST-REx-ID: 3856   OA
K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.
View | Files available | DOI | Download (ext.)
 
[76]
2010 | Journal Article | IST-REx-ID: 3868   OA
K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game metrics,” Logical Methods in Computer Science, vol. 6, no. 3, pp. 1–27, 2010.
View | Files available | DOI
 
[75]
2010 | Journal Article | IST-REx-ID: 3863
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” Information and Computation, vol. 208, no. 10, pp. 1206–1220, 2010.
View | Files available | DOI
 
[74]
2010 | Technical Report | IST-REx-ID: 5388   OA
K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.
View | Files available | DOI
 
[73]
2010 | Technical Report | IST-REx-ID: 5390   OA
K. Chatterjee and N. Fijalkow, Topological, automata-theoretic and logical characterization of finitary languages. IST Austria, 2010.
View | Files available | DOI
 
[72]
2010 | Conference Paper | IST-REx-ID: 3851
K. Chatterjee and L. Doyen, “Energy parity games,” presented at the ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France, 2010, vol. 6199, pp. 599–610.
View | Files available | DOI | Download (ext.) | arXiv
 
[71]
2009 | Journal Article | IST-REx-ID: 3869
K. Chatterjee, L. De Alfaro, M. Faella, and A. Legay, “Qualitative logics and equivalences for probabilistic systems,” Logical Methods in Computer Science, vol. 5, no. 2, 2009.
View | DOI
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Probabilistic weighted automata,” presented at the CONCUR: Concurrency Theory, Bologna, Italy, 2009, vol. 5710, pp. 244–258.
View | Files available | DOI
 
[69]
2009 | Conference Paper | IST-REx-ID: 4545   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of stochastic games with limsup and liminf objectives,” presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece, 2009, vol. 5556, pp. 1–15.
View | Files available | DOI
 
[68]
2009 | Conference Paper | IST-REx-ID: 4569   OA
R. Bloem, K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Better quality in synthesis through quantitative objectives,” presented at the CAV: Computer Aided Verification, Grenoble, France, 2009, vol. 5643, pp. 140–156.
View | DOI | Download (ext.) | arXiv
 
[67]
2009 | Conference Paper | IST-REx-ID: 4540
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” presented at the LICS: Logic in Computer Science, 2009, pp. 199–208.
View | Files available | DOI
 
[66]
2009 | Technical Report | IST-REx-ID: 5392   OA
K. Chatterjee, Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria, 2009.
View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4580   OA
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Alpaga: A tool for solving parity games with imperfect information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2009, vol. 5505, pp. 58–61.
View | Files available | DOI | Download (ext.)
 
[64]
2009 | Conference Paper | IST-REx-ID: 4542   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,” presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009, vol. 5699, pp. 3–13.
View | Files available | DOI
 
[63]
2009 | Technical Report | IST-REx-ID: 5393   OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist: A solver for probabilistic games. IST Austria, 2009.
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4543
K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.
View | DOI
 
[61]
2009 | Technical Report | IST-REx-ID: 5394   OA
K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for request-response and finitary Streett games. IST Austria, 2009.
View | Files available | DOI
 
[60]
2009 | Conference Paper | IST-REx-ID: 3503   OA
K. Chatterjee and T. A. Henzinger, “Probabilistic systems with limsup and liminf objectives,” presented at the ILC: Infinity in Logic and Computation, 2009, vol. 5489, pp. 32–45.
View | DOI | Download (ext.)
 
[59]
2009 | Journal Article | IST-REx-ID: 3870   OA
K. Chatterjee, T. A. Henzinger, and F. Horn, “Finitary winning in omega-regular games,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 1, 2009.
View | Files available | DOI
 
[58]
2009 | Conference Paper | IST-REx-ID: 4544   OA
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Termination criteria for solving concurrent safety and reachability games,” presented at the SODA: Symposium on Discrete Algorithms, 2009, pp. 197–206.
View | Files available | DOI | Download (ext.)
 
[57]
2009 | Technical Report | IST-REx-ID: 5395   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, Qualitative analysis of partially-observable Markov decision processes. IST Austria, 2009.
View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3876
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: complexity and robustness,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2008, vol. 5215, pp. 124–140.
View | Files available | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3504
K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game metrics,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2008, vol. 2, pp. 107–118.
View | Files available | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3877
K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Environment assumptions for synthesis,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201, pp. 147–161.
View | DOI
 
[53]
2008 | Book Chapter | IST-REx-ID: 3872
K. Chatterjee and T. A. Henzinger, “Value iteration,” in 25 Years in Model Checking, vol. 5000, Springer, 2008, pp. 107–138.
View | DOI
 
[52]
2008 | Journal Article | IST-REx-ID: 4534
K. Chatterjee and T. A. Henzinger, “Reduction of stochastic parity to stochastic mean-payoff games,” Information Processing Letters, vol. 106, no. 1, pp. 1–7, 2008.
View | DOI | Download (ext.)
 
[51]
2008 | Conference Paper | IST-REx-ID: 4546
K. Chatterjee et al., “Logical reliability of interacting real-time tasks,” presented at the DATE: Design, Automation and Test in Europe, 2008, pp. 909–914.
View | DOI | Download (ext.)
 
[50]
2008 | Conference Paper | IST-REx-ID: 3501
B. T. Adler, K. Chatterjee, L. De Alfaro, M. Faella, I. Pye, and V. Raman, “Assigning trust to Wikipedia content,” presented at the WikiSym: International Symposium on Wikis, 2008.
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3873
K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Controller synthesis with budget constraints,” presented at the HSCC: Hybrid Systems - Computation and Control, 2008, vol. 4981, pp. 72–86.
View | DOI
 
[48]
2008 | Conference Paper | IST-REx-ID: 3878   OA
K. Chatterjee, L. De Alfaro, and R. Majumdar, “The complexity of coverage,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, 2008, vol. 5356, pp. 91–106.
View | DOI | Download (ext.)
 
[47]
2008 | Conference Paper | IST-REx-ID: 3880
D. Berwanger, K. Chatterjee, L. Doyen, T. A. Henzinger, and S. Raje, “Strategy construction for parity games with imperfect information,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201, pp. 325–339.
View | Files available | DOI
 
[46]
2008 | Conference Paper | IST-REx-ID: 3502
K. Chatterjee, L. De Alfaro, and I. Pye, “Robust content-driven reputation,” presented at the AISec: Artificial Intelligence and Security, 2008, pp. 33–42.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3874
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Trading infinite memory for uniform randomness in timed games,” presented at the HSCC: Hybrid Systems - Computation and Control, 2008, vol. 4981, pp. 87–100.
View | DOI
 
[44]
2008 | Conference Paper | IST-REx-ID: 3879
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” presented at the CSL: Computer Science Logic, 2008, vol. 5213, pp. 385–400.
View | DOI
 
[43]
2008 | Journal Article | IST-REx-ID: 4548
K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Stochastic limit-average games are in EXPTIME,” International Journal of Game Theory, vol. 37, no. 2, pp. 219–234, 2008.
View | DOI | Download (ext.)
 
[42]
2008 | Conference Paper | IST-REx-ID: 3875
K. Chatterjee, T. A. Henzinger, and K. Sen, “Model-checking omega-regular properties of interval Markov chains,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2008, vol. 4962, pp. 302–317.
View | DOI
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
K. Chatterjee, T. A. Henzinger, and N. Piterman, “Generalized parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007, vol. 4423, pp. 153–167.
View | DOI
 
[40]
2007 | Conference Paper | IST-REx-ID: 3884
K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” presented at the CONCUR: Concurrency Theory, 2007, vol. 4703, pp. 59–73.
View | Files available | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3885
K. Chatterjee, “Optimal strategy synthesis in stochastic Müller games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007, vol. 4423, pp. 138–152.
View | DOI
 
[38]
2007 | Journal Article | IST-REx-ID: 4547
K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” Logical Methods in Computer Science, vol. 3, no. 184, pp. 1–23, 2007.
View | DOI
 
[37]
2007 | Thesis | IST-REx-ID: 4559
K. Chatterjee, Stochastic ω-Regular Games. University of California, Berkeley, 2007, pp. 1–247.
View | Download (ext.)
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
K. Chatterjee, “Stochastic Müller games are PSPACE-complete,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2007, vol. 4855, pp. 436–448.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3881
L. De Alfaro, K. Chatterjee, M. Faella, and A. Legay, “Qualitative logics and equivalences for probabilistic systems,” presented at the QEST: Quantitative Evaluation of Systems, 2007, pp. 237–248.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 3887
K. Chatterjee, “Markov decision processes with multiple long-run average objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2007, vol. 4855, pp. 473–484.
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 3882
K. Chatterjee, “Concurrent games with tail objectives,” Theoretical Computer Science, vol. 388, no. 1–3, pp. 181–198, 2007.
View | DOI
 
[32]
2007 | Conference Paper | IST-REx-ID: 4537
K. Chatterjee and T. A. Henzinger, “Assume-guarantee synthesis,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2007, vol. 4424, pp. 261–275.
View | DOI
 
[31]
2006 | Conference Paper | IST-REx-ID: 3888
K. Chatterjee and T. A. Henzinger, “Strategy improvement for stochastic Rabin and Streett games,” presented at the CONCUR: Concurrency Theory, 2006, vol. 4137, pp. 375–389.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3890
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “The complexity of quantitative concurrent parity games,” presented at the SODA: Symposium on Discrete Algorithms, 2006, pp. 678–687.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 4552
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability games,” presented at the QEST: Quantitative Evaluation of Systems, 2006, pp. 291–300.
View | DOI
 
[28]
2006 | Conference Paper | IST-REx-ID: 4538
K. Chatterjee and T. A. Henzinger, “Strategy improvement and randomized subexponential algorithms for stochastic parity games,” presented at the STACS: Theoretical Aspects of Computer Science, 2006, vol. 3884, pp. 512–523.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3500
K. Chatterjee, T. A. Henzinger, and N. Piterman, “Algorithms for Büchi Games,” presented at the GDV: Games in Design and Verification, 2006.
View | Download (ext.)
 
[26]
2006 | Conference Paper | IST-REx-ID: 3889
K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 287–302.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3891
K. Chatterjee, “Concurrent games with tail objectives,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 256–270.
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
K. Chatterjee and T. A. Henzinger, “Finitary winning in omega-regular games,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2006, vol. 3920, pp. 257–271.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 3449
K. Chatterjee, R. Jagadeesan, and C. Pitcher, “Games for controls,” presented at the CSF: Computer Security Foundations, 2006, pp. 70–82.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 3499
K. Chatterjee, “Nash equilibrium for upward-closed objectives,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 271–286.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Games with secure equilibria,” Theoretical Computer Science, vol. 365, no. 1–2, pp. 67–82, 2006.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
K. Chatterjee, L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “Compositional quantitative reasoning,” presented at the QEST: Quantitative Evaluation of Systems, 2006, pp. 179–188.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4551
K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Markov decision processes with multiple objectives,” presented at the STACS: Theoretical Aspects of Computer Science, 2006, vol. 3884, pp. 325–336.
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 4557
K. Chatterjee, T. A. Henzinger, R. Jhala, and R. Majumdar, “Counterexample-guided planning,” presented at the UAI: Uncertainty in Artificial Intelligence, 2005, pp. 104–111.
View | Download (ext.)
 
[17]
2005 | Conference Paper | IST-REx-ID: 3896
K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “Complexity of compositional model checking of computation tree logic on simple structures,” presented at the IWDC: International Workshop on Distributed Computing , 2005, vol. 3326, pp. 89–102.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 4541
K. Chatterjee and T. A. Henzinger, “Semiperfect-information games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2005, vol. 3821, pp. 1–18.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4553
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “The complexity of stochastic Rabin and Streett games,” presented at the ICALP: Automata, Languages and Programming, 2005, vol. 3580, pp. 878–890.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4560
A. Chakrabarti, K. Chatterjee, T. A. Henzinger, O. Kupferman, and R. Majumdar, “Verifying quantitative properties using bound functions,” presented at the CHARME: Correct Hardware Design and Verification Methods, 2005, vol. 3725, pp. 50–64.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 3892
K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Games with secure equilibria,” presented at the FMCO: Formal Methods for Components and Objects, 2005, vol. 3657, pp. 141–161.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4554
K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Mean-payoff parity games,” presented at the LICS: Logic in Computer Science, 2005, pp. 178–187.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3893
K. Chatterjee, “Two-player nonzero-sum ω-regular games,” presented at the CONCUR: Concurrency Theory, 2005, vol. 3653, pp. 413–427.
View | DOI
 
[10]
2004 | Conference Paper | IST-REx-ID: 3895
K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Games with secure equilibria,” presented at the LICS: Logic in Computer Science, 2004, pp. 160–169.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 4558
K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Quantitative stochastic parity games,” presented at the SODA: Symposium on Discrete Algorithms, 2004, pp. 121–130.
View
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Trading memory for randomness,” presented at the QEST: Quantitative Evaluation of Systems, 2004, pp. 206–217.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 3894
K. Chatterjee, R. Majumdar, and M. Jurdziński, “On Nash equilibria in stochastic games,” presented at the CSL: Computer Science Logic, 2004, vol. 3210, pp. 26–40.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” Information and Computation, vol. 194, no. 2, pp. 144–174, 2004.
View | DOI
 
[5]
2003 | Journal Article | IST-REx-ID: 3593
K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “A branching time temporal framework for quantitative reasoning,” Journal of Automated Reasoning, vol. 30, no. 2, pp. 205–232, 2003.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3897
K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Simple stochastic parity games,” presented at the CSL: Computer Science Logic, 2003, vol. 2803, pp. 100–113.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3898
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” presented at the SAS: Static Analysis Symposium, 2003, vol. 2694, pp. 109–126.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
S. Mallick, K. Chatterjee, A. Merchant, and P. Dasgupta, “Implementation of shape grammar for plan analysis,” presented at the IT-Built: Information Technology For Built Environment, 2002.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “Weighted quantified computation tree logic,” presented at the CIT: Conference on Information Technology, 2001.
View
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed