Please note that ISTA 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.

10590 Publications


2013 | Published | Conference Paper | IST-REx-ID: 2886 | OA
Controllable-choice message sequence graphs
M. Chmelik, V. Řehák, 7721 (2013) 118–130.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2013 | Published | Journal Article | IST-REx-ID: 2836 | OA
Assume-guarantee synthesis for digital contract signing
K. Chatterjee, V. Raman, Formal Aspects of Computing 26 (2013) 825–859.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Journal Article | IST-REx-ID: 2824
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
K. Chatterjee, V. Prabhu, Information and Computation 228–229 (2013) 83–119.
View | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2305 | OA
Trading performance for stability in Markov decision processes
T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, in:, 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–340.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 2279 | OA
Looking at mean-payoff and total-payoff through windows
K. Chatterjee, L. Doyen, M. Randour, J. Raskin, 8172 (2013) 118–132.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2013 | Published | Conference Paper | IST-REx-ID: 2295 | OA
What is decidable about partially observable Markov decision processes with omega-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.
[Published Version] View | Files available | DOI
 

2013 | Published | Technical Report | IST-REx-ID: 5400 | OA
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Technical Report | IST-REx-ID: 5404 | OA
The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2329 | OA
Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, 8052 (2013) 500–515.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 10902
How to travel between languages
Chatterjee, Krishnendu, How to travel between languages. 7th International Conference on Language and Automata Theory and Applications 7810. 2013
View | DOI
 

2013 | Published | Technical Report | IST-REx-ID: 5405 | OA
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Technical Report | IST-REx-ID: 5408 | OA
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Journal Article | IST-REx-ID: 2817 | OA
Density games
S. Novak, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 334 (2013) 26–34.
[Published Version] View | Files available | DOI
 

2013 | Published | Journal Article | IST-REx-ID: 2289 | OA
Quantitative reactive modeling and verification
T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.
[Published Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2181 | OA
Quantitative relaxation of concurrent data structures
T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.
[Submitted Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2182
Quantitative abstraction refinement
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.
View | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2819 | OA
Quantitative timed simulation functions and refinement metrics for real-time systems
K. Chatterjee, V. Prabhu, in:, Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Springer, 2013, pp. 273–282.
[Preprint] View | DOI | Download Preprint (ext.)
 

2013 | Published | Technical Report | IST-REx-ID: 5410 | OA
Automatic generation of alternative starting positions for traditional board games
U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Book Chapter | IST-REx-ID: 5747 | OA
Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
Dragoi, Cezara, Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. Computer Aided Verification 8044. 2013
View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 10898
Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation
Haas, Andreas, Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF '13 (5). 2013
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed