DOI,IST REx ID,Research Group,Title of publication
10.1016/j.ic.2013.04.003,2824,KrCh,"Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems"
10.1007/s10703-012-0180-2,2831,KrCh,Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
10.1007/s00165-013-0283-6,2836,KrCh,Assume-guarantee synthesis for digital contract signing
10.1016/j.jcss.2012.12.001,2854,"KrCh,ToHe",Strategy improvement for concurrent reachability and turn based stochastic safety games
10.1111/eva.12020,2858,KrCh,The effect of one additional driver mutation on tumor progression
10.1007/978-3-642-36046-6_12,2886,KrCh,Controllable-choice message sequence graphs
10.4230/LIPIcs.CSL.2013.181,1374,KrCh,Infinite-state games with finitary conditions
10.1109/FMCAD.2013.6679386,1376,"KrCh,ToHe",Distributed synthesis for LTL fragments
10.15479/AT:IST-2013-104-v1-1,5399,KrCh,TTP: Tool for Tumor Progression
10.15479/AT:IST-2013-109-v1-1,5400,KrCh,"What is decidable about partially observable Markov decision processes with ω-regular objectives"
10.15479/AT:IST-2013-126-v1-1,5403,KrCh,Qualitative analysis of concurrent mean-payoff games
10.15479/AT:IST-2013-127-v1-1,5404,KrCh,The complexity of ergodic games
10.15479/AT:IST-2013-128-v1-1,5405,KrCh,Perfect-information stochastic mean-payoff parity games
10.15479/AT:IST-2013-130-v1-1,5406,"KrCh,ToHe",Distributed synthesis for LTL Fragments
10.15479/AT:IST-2013-141-v1-1,5408,KrCh,The complexity of partial-observation stochastic parity games with finite-memory strategies
10.15479/AT:IST-2013-144-v1-1,5409,KrCh,Edit distance for timed automata
10.15479/AT:IST-2013-146-v1-1,5410,KrCh,Automatic generation of alternative starting positions for traditional board games
10.1007/978-3-642-36046-6_11,19995,KrCh,Strategy complexity of finite-horizon Markov decision processes and simple stochastic games
10.1007/978-3-642-39799-8_6,2000,KrCh,TTP: Tool for tumor progression
10.1007/s10703-012-0170-4,3116,KrCh,Code aware resource management