_id,doi,title
3326,10.1007/978-3-642-24372-1_37,"What’s decidable about weighted automata "
531,10.1007/s10703-011-0131-3,Verification of STM on relaxed memory models
5383,10.15479/AT:IST-2011-0005,On an efficient decision procedure for imperative tree data structures
5385,10.15479/AT:IST-2011-0003,Temporal specifications with accumulative values
3352,10.1145/2001269.2001289,Biology as reactivity
3353,10.1145/1985342.1985345,A theory of synchronous relational interfaces
3354,10.1145/1970398.1970404,Qualitative concurrent parity games
3355,10.1109/QEST.2011.40,Quantitative evaluation of BFT protocols
3356,10.1109/LICS.2011.33,Temporal specifications with accumulative values
3357,10.1007/978-3-642-21254-3_17,The complexity of request-response games
3358,10.1145/1966445.1966476,Scheduling large jobs by abstraction refinement
3359,10.1145/2038642.2038666,From boolean to quantitative synthesis
3360,10.4230/LIPIcs.CSL.2011.82,Determinizing discounted-sum automata
3361,10.1109/CSF.2011.21,The complexity of quantitative information flow problems
3362,10.1007/978-3-642-23217-6_27,Dynamic reactive modules
3363,,The decidability frontier for probabilistic automata on infinite words
3364,10.1016/j.tcs.2010.10.022,Approximation of event probabilities in noisy cellular processes
3365,10.1007/978-3-642-19835-9_24,QUASY: quantitative synthesis tool
3366,10.1007/978-3-642-22110-1_20,Quantitative synthesis for concurrent programs
3381,10.1142/S0129054111008441,Formalisms for specifying Markovian population models