_id,doi,title
9393,10.1007/s10703-021-00373-5,Faster algorithms for quantitative verification in bounded treewidth graphs
738,10.1007/s11241-017-9293-4,Automated competitive analysis of real time scheduling with graph games
34,,Sensor synthesis for POMDPs with reachability objectives
1066,10.1016/j.ic.2016.10.006,Quantitative fair simulation games
717,10.1016/j.jcss.2017.04.005,Hyperplane separation technique for multidimensional mean-payoff games
467,10.1145/3152769,Nested weighted automata
1294,10.1016/j.jcss.2016.09.009,Trading performance for stability in Markov decision processes
1477,10.1016/j.jcss.2016.02.009,"What is decidable about partially observable Markov decision processes with ω-regular objectives"
10796,10.1137/1.9781611973730.69,The value 1 problem under finite-memory strategies for concurrent mean-payoff games
1624,10.1038/srep17147,Cellular cooperation with shift updating and repulsion
1656,10.1109/LICS.2015.72,Nested weighted automata
1694,10.1109/TAC.2015.2404612,Quantitative temporal simulation and refinement distances for timed systems
1698,10.1016/j.ic.2015.03.001,The complexity of multi-mean-payoff and multi-energy games
1709,10.1098/rspb.2015.1041,Biological auctions with multiple rewards
1731,10.1016/j.ic.2015.06.003,Randomness for free
1856,10.1145/2699430,Measuring and synthesizing systems in probabilistic environments
2034,10.1016/j.ipl.2014.09.001,Probabilistic opacity for Markov decision processes
523,10.1016/j.ic.2015.03.010,Looking at mean-payoff and total-payoff through windows
1481,,Automatic generation of alternative starting positions for simple traditional board games
1501,10.1007/s10703-015-0235-2,CEGAR for compositional analysis of qualitative properties in Markov decision processes