_id,doi,title
1731,10.1016/j.ic.2015.06.003,Randomness for free
3249,10.1016/j.tcs.2011.08.002,Simulation distances
3315,10.2168/LMCS-7(4:8)2011,Timed parity games: Complexity and robustness
5385,10.15479/AT:IST-2011-0003,Temporal specifications with accumulative values
3353,10.1145/1985342.1985345,A theory of synchronous relational interfaces
3356,10.1109/LICS.2011.33,Temporal specifications with accumulative values
3360,10.4230/LIPIcs.CSL.2011.82,Determinizing discounted-sum automata
3363,,The decidability frontier for probabilistic automata on infinite words
3853,10.1007/978-3-642-15375-4_19,Mean-payoff automaton expressions
3855,10.1007/978-3-642-15155-2_24,Qualitative analysis of partially-observable Markov Decision Processes
3856,10.1007/978-3-642-15155-2_23,Randomness for free
3857,10.1007/978-3-642-15643-4_1,Probabilistic Automata on infinite words: decidability and undecidability results
3862,10.1145/1805950.1805953,Quantitative languages
3863,10.1016/j.ic.2009.09.006,Strategy construction for parity games with imperfect information
3866,10.1007/978-3-642-14295-6_36,Robustness in the presence of liveness
3867,10.2168/LMCS-6(3:10)2010,Expressiveness and closure properties for quantitative languages
4369,10.1007/978-3-642-15297-9_13,From MTL to deterministic timed automata
4388,10.1007/978-3-642-14295-6_57,GIST: A solver for probabilistic games
4392,10.1007/978-3-642-13754-9_3,Quantitative Simulation Games
4393,10.1007/978-3-642-15375-4_18,Simulation distances