_id,doi,title
3343,10.1137/1.9781611973082.101,Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
3344,10.1007/978-3-642-24288-5_1,Graph games with reachability objectives
5379,10.15479/AT:IST-2011-0009,An O(n2) time algorithm for alternating Büchi games
5380,10.15479/AT:IST-2011-0008,Bounded rationality in concurrent parity games
5381,10.15479/AT:IST-2011-0007,Partial-observation stochastic games: How to win when belief fails
5382,10.15479/AT:IST-2011-0006,Robustness of structurally equivalent concurrent parity games
5384,10.15479/AT:IST-2011-0004,Decidable problems for probabilistic automata on infinite words
5385,10.15479/AT:IST-2011-0003,Temporal specifications with accumulative values
5387,10.15479/AT:IST-2011-0001,Energy and mean-payoff parity Markov decision processes
3345,10.1007/978-3-642-22993-0_21,Energy and mean-payoff parity Markov Decision Processes
3346,10.1109/LICS.2011.10,Two views on multiple mean payoff objectives in Markov Decision Processes
3347,10.1007/978-3-642-21254-3_16,Finitary languages
3348,10.1145/1967701.1967734,Synthesis of memory efficient real time controllers for safety objectives
3349,10.4204/EPTCS.54.6,A reduction from parity games to simple stochastic games
3350,10.1007/978-3-642-24310-3_11,Minimum attention controller synthesis for omega regular objectives
3351,10.1007/978-3-642-22953-4_13,On memoryless quantitative objectives
3354,10.1145/1970398.1970404,Qualitative concurrent parity games
3356,10.1109/LICS.2011.33,Temporal specifications with accumulative values
3357,10.1007/978-3-642-21254-3_17,The complexity of request-response games
3361,10.1109/CSF.2011.21,The complexity of quantitative information flow problems