Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

338 Publications


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.)
 

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
 

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
 

2017 | Journal Article | IST-REx-ID: 1294
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
 

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, 2017.
View | Files available | DOI
 

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, 2017.
View | Files available | DOI
 

2017 | Book Chapter | IST-REx-ID: 625   OA
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 | Files available | DOI
 

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
 

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
 

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.)
 

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, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 

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.)
 

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
 

2017 | Conference Paper | IST-REx-ID: 950   OA
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.
View | Files available | DOI | arXiv
 

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.)
 

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
 

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
 

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.)
 

2017 | Journal Article | IST-REx-ID: 653   OA
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 | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 716   OA
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 | Download (ext.) | arXiv
 

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
 

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.)
 

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
 

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
 

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.)
 

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.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 717   OA
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.)
 

2016 | Journal Article | IST-REx-ID: 1200   OA
C. Hilbe and A. Traulsen, “Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on ‘Evolutionary game theory using agent-based methods’ by C. Adami, J. Schossau and A. Hintze,” Physics of Life Reviews, vol. 19, pp. 29–31, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1325   OA
T. Brázdil, V. Forejt, A. Kučera, and P. Novotny, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.
View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1426   OA
M. Chakra, C. Hilbe, and A. Traulsen, “Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites,” Royal Society Open Science, vol. 3, no. 5, 2016.
View | Files available | DOI
 

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
 

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
 

2016 | Conference Paper | IST-REx-ID: 1326   OA
T. Brázdil, A. Kučera, and P. Novotny, “Optimizing the expected mean payoff in Energy Markov Decision Processes,” presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan, 2016, vol. 9938, pp. 32–49.
View | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1333   OA
M. Milinski, C. Hilbe, D. Semmann, R. Sommerfeld, and J. Marotzke, “Humans choose representatives who enforce cooperation in social dilemmas through extortion,” Nature Communications, vol. 7, 2016.
View | Files available | DOI
 

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
 

2016 | Conference Paper | IST-REx-ID: 1340   OA
K. Hansen, R. Ibsen-Jensen, and M. Koucký, “The big match in small space,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 64–76.
View | DOI | Download (ext.)
 

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
 

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.)
 

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
 

2016 | Journal Article | IST-REx-ID: 1322   OA
C. Hilbe, K. Hagel, and M. Milinski, “Asymmetric power boosts extortion in an economic experiment,” PLoS One, vol. 11, no. 10, 2016.
View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1423   OA
S. Baek, H. Jeong, C. Hilbe, and M. Nowak, “Comparing reactive and memory-one strategies of direct reciprocity,” Scientific Reports, vol. 6, 2016.
View | Files available | DOI
 

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
 

2016 | Conference Paper | IST-REx-ID: 1093
P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.
View | Files available | DOI
 

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.)
 

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.)
 

2016 | Conference Paper | IST-REx-ID: 1389   OA
V. K. Chonev, J. Ouaknine, and J. Worrell, “On recurrent reachability for continuous linear dynamical systems,” in LICS ’16, New York, NY, USA, 2016, pp. 515–524.
View | DOI | Download (ext.)
 

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
 

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
 

2016 | Journal Article | IST-REx-ID: 1380   OA
V. K. Chonev, J. Ouaknine, and J. Worrell, “On the complexity of the orbit problem,” Journal of the ACM, vol. 63, no. 3, 2016.
View | DOI | Download (ext.)
 

2016 | Thesis | IST-REx-ID: 1397
M. Chmelik, Algorithms for partially observable markov decision processes. IST Austria, 2016.
View
 

2016 | Journal Article | IST-REx-ID: 1518   OA
K. Lohse, M. Chmelik, S. Martin, and N. H. Barton, “Efficient strategies for calculating blockwise likelihoods under the coalescent,” Genetics, vol. 202, no. 2, pp. 775–786, 2016.
View | Files available | DOI
 

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
 

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
 

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
 

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.) | arXiv
 

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.)
 

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.)
 

2016 | Technical Report | IST-REx-ID: 5445
K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
View | Files available | DOI
 

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
 

2016 | Conference Paper | IST-REx-ID: 1069   OA
V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.
View | Files available | DOI
 

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
 

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.)
 

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.)
 

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
 

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
 

2015 | Journal Article | IST-REx-ID: 1851
T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating,” Evolution, vol. 69, no. 4, pp. 1015–1026, 2015.
View | DOI
 

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
 

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.)
 

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, 2015.
View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1856   OA
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.)
 

2015 | Conference Paper | IST-REx-ID: 1882   OA
U. Fahrenberg, J. Kretinsky, A. Legay, and L. Traonouez, “Compositionality for quantitative specifications,” presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy, 2015, vol. 8997, pp. 306–324.
View | DOI | Download (ext.)
 

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
 

2015 | Journal Article | IST-REx-ID: 1731   OA
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.)
 

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.
View | Files available | DOI | Download (ext.)
 

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
 

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.)
 

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
 

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
 

2015 | Conference Paper | IST-REx-ID: 1667   OA
T. Brázdil, L. Korenčiak, J. Krčál, P. Novotny, and V. Řehák, “Optimizing performance of continuous-time stochastic systems using timeout synthesis,” vol. 9259. Springer, pp. 141–159, 2015.
View | DOI | Download (ext.)
 

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
 

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
 

2015 | Technical Report | IST-REx-ID: 5443
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
 

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
 

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
 

2015 | Conference Paper | IST-REx-ID: 1732   OA
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
 

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.)
 

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.)
 

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
 

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
 

2015 | Research Data | IST-REx-ID: 5549   OA
A. Fellner, Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. IST Austria, 2015.
View | Files available | DOI
 

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
 

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
 

2015 | Conference Paper | IST-REx-ID: 1601
T. Babiak et al., “The Hanoi omega-automata format,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 479–486.
View | DOI
 

2015 | Technical Report | IST-REx-ID: 5437
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View | Files available | DOI
 

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.)
 

2015 | Journal Article | IST-REx-ID: 1846
N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement checking on parametric modal transition systems,” Acta Informatica, vol. 52, no. 2–3, pp. 269–297, 2015.
View | DOI
 

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.)
 

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
 

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.)
 

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.
View | Files available | DOI | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed