DOI,IST REx ID,Research Group,Title of publication
10.1007/978-3-642-22110-1_21,3342,KrCh,Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
10.1137/1.9781611973082.101,3343,KrCh,Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
10.1007/978-3-642-24288-5_1,3344,KrCh,Graph games with reachability objectives
10.1007/978-3-642-22993-0_21,3345,KrCh,Energy and mean-payoff parity Markov Decision Processes
10.1109/LICS.2011.10,3346,KrCh,Two views on multiple mean payoff objectives in Markov Decision Processes
10.1007/978-3-642-21254-3_16,3347,KrCh,Finitary languages
10.1145/1967701.1967734,3348,KrCh,Synthesis of memory efficient real time controllers for safety objectives
10.4204/EPTCS.54.6,3349,KrCh,A reduction from parity games to simple stochastic games
10.1007/978-3-642-24310-3_11,3350,KrCh,Minimum attention controller synthesis for omega regular objectives
10.1007/978-3-642-22953-4_13,3351,KrCh,On memoryless quantitative objectives
10.1145/1970398.1970404,3354,"KrCh,ToHe",Qualitative concurrent parity games
10.1109/LICS.2011.33,3356,"ToHe,KrCh",Temporal specifications with accumulative values
10.1007/978-3-642-21254-3_17,3357,"KrCh,ToHe",The complexity of request-response games
10.1109/CSF.2011.21,3361,"ToHe,KrCh",The complexity of quantitative information flow problems
null,3363,"KrCh,ToHe",The decidability frontier for probabilistic automata on infinite words
10.1007/978-3-642-19835-9_24,3365,"KrCh,ToHe",QUASY: quantitative synthesis tool
10.1007/978-3-642-22110-1_20,3366,"ToHe,KrCh",Quantitative synthesis for concurrent programs
10.15479/AT:IST-2011-0009,5379,KrCh,An O(n2) time algorithm for alternating Büchi games
10.15479/AT:IST-2011-0008,5380,KrCh,Bounded rationality in concurrent parity games
10.15479/AT:IST-2011-0007,5381,KrCh,Partial-observation stochastic games: How to win when belief fails