DOI,IST REx ID,Research Group,Title of publication
10.1016/j.ic.2015.06.003,1731,"KrCh,ToHe",Randomness for free
10.1016/j.tcs.2011.08.002,3249,ToHe,Simulation distances
10.1109/SIES.2011.5953660,3316,"KrCh,ToHe",Specification-centered robustness
10.1145/1985342.1985345,3353,ToHe,A theory of synchronous relational interfaces
10.1109/LICS.2011.33,3356,"ToHe,KrCh",Temporal specifications with accumulative values
10.1145/2038642.2038666,3359,ToHe,From boolean to quantitative synthesis
10.4230/LIPIcs.CSL.2011.82,3360,ToHe,Determinizing discounted-sum automata
null,3363,"KrCh,ToHe",The decidability frontier for probabilistic automata on infinite words
10.1007/978-3-642-22110-1_20,3366,"ToHe,KrCh",Quantitative synthesis for concurrent programs
10.15479/AT:IST-2011-0003,5385,"ToHe,KrCh",Temporal specifications with accumulative values
10.1007/978-3-642-15375-4_19,3853,"KrCh,HeEd,ToHe",Mean-payoff automaton expressions
10.1007/978-3-642-15155-2_24,3855,"KrCh,ToHe",Qualitative analysis of partially-observable Markov Decision Processes
10.1007/978-3-642-15155-2_23,3856,"KrCh,ToHe",Randomness for free
10.1007/978-3-642-15643-4_1,3857,"KrCh,ToHe",Probabilistic Automata on infinite words: decidability and undecidability results
10.1007/978-3-642-14295-6_36,3866,"KrCh,ToHe",Robustness in the presence of liveness
10.2168/LMCS-6(3:10)2010,3867,"KrCh,ToHe",Expressiveness and closure properties for quantitative languages
10.1007/978-3-642-15297-9_13,4369,ToHe,From MTL to deterministic timed automata
10.1007/978-3-642-14295-6_57,4388,"KrCh,ToHe",GIST: A solver for probabilistic games
10.1007/978-3-642-13754-9_3,4392,ToHe,Quantitative Simulation Games
10.1007/978-3-642-15375-4_18,4393,ToHe,Simulation distances