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.

356 Publications


2015 | Conference Paper | IST-REx-ID: 1689 | 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,” 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 Preprint (ext.)
 

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
 

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. IEEE, pp. 2291–2306, 2015.
View | DOI
 

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. Elsevier, pp. 177–196, 2015.
View | DOI | Download Preprint (ext.)
 

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. Multidisciplinary Digital Publishing Institute, pp. 413–437, 2015.
View | Files available | DOI
 

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. Royal Society, 2015.
View | Files available | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 

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 Preprint (ext.) | arXiv
 

2015 | Journal Article | IST-REx-ID: 1846 | OA
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. Springer, pp. 269–297, 2015.
View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1851 | OA
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. Wiley-Blackwell, pp. 1015–1026, 2015.
View | Files available | DOI
 

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 Preprint (ext.)
 

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 Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1873 | OA
K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” Artificial Intelligence, vol. 221. Elsevier, pp. 46–72, 2015.
View | DOI | Download Preprint (ext.) | arXiv
 

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 Preprint (ext.)
 

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. Elsevier, pp. 52–59, 2015.
View | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1598 | OA
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. Elsevier, pp. 71–89, 2015.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Thesis | IST-REx-ID: 1400
J. Reiter, “The subclonal evolution of cancer,” IST Austria, 2015.
View | Files available
 

2015 | Conference Paper | IST-REx-ID: 1661 | OA
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 Submitted Version (ext.)
 

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. Elsevier, pp. 3–16, 2015.
View | Files available | DOI | Download Preprint (ext.)
 

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

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. Elsevier, pp. 25–52, 2015.
View | Files available | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 524 | OA
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1481 | OA
U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752.
View | Files available | Download None (ext.)
 

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 Preprint (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: 5436 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.
View | Files available | DOI
 

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
 

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
 

2015 | Technical Report | IST-REx-ID: 5429 | OA
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: 5435 | OA
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 | 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
 

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

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
 

2015 | Technical Report | IST-REx-ID: 5438 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5432 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5440 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 

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
 

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 | 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 | Conference Paper | IST-REx-ID: 1603 | OA
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 Preprint (ext.)
 

2015 | Technical Report | IST-REx-ID: 5441 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1602 | OA
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. ACM, pp. 97–109, 2015.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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. ACM, pp. 539–551, 2015.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1607 | OA
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 Preprint (ext.)
 

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
 

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. Elsevier, pp. 104–116, 2014.
View | DOI | Download Submitted Version (ext.)
 

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
 

2014 | Journal Article | IST-REx-ID: 1884
D. Landau et al., “Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples,” Blood, vol. 124, no. 21. American Society of Hematology, pp. 1952–1952, 2014.
View | Download None (ext.)
 

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. Public Library of Science, 2014.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2052
B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model checking of rendezvous systems,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 109–124.
View | DOI
 

2014 | Conference Paper | IST-REx-ID: 2053 | OA
H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 249–265.
View | DOI | Download Submitted Version (ext.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications