Result 1 to 20 of 144 total
Minimizing expected termination time in one-counter Markov decision processes. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 141-152 (2012).
1
Stochastic game logic. (English)
Acta Inf. 49, No. 4, 203-224 (2012).
2
Efficient controller synthesis for consumption games with multiple resource types. (English)
Madhusudan, P. (ed.) et al., Computer aided verification. 24th international conference, CAV 2012, Berkeley, CA, USA, July 7‒13, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31423-0/pbk). Lecture Notes in Computer Science 7358, 23-38 (2012).
3
Demuth’s path to randomness. (English)
Dinneen, Michael J. (ed.) et al., Computation, physics and beyond. International workshop on theoretical computer science, WTCS 2012, dedicated to Cristian S. Calude on the occasion of his 60th birthday, Auckland, New Zealand, February 21‒24, 2012. Revised selected and invited papers. Berlin: Springer (ISBN 978-3-642-27653-8/pbk). Lecture Notes in Computer Science 7160, 159-173 (2012).
4
Special issue: Mathematical foundations of computer science (MFCS 2010). Selected papers based on the presentations at the 35th international symposium, Brno, Czech Republic, August 23‒27, 2010. (English)
Theor. Comput. Sci. 417, 107~p. (2012).
5
Randomness: a tool for constructing and analyzing computer programs. (English)
Zenil, Hector (ed.), Randomness through computation. Some answers, more questions. Hackensack, NJ: World Scientific (ISBN 978-981-4327-74-9/hbk; 978-981-4327-75-6/ebook). 275-281 (2011).
6
Qualitative reachability in stochastic BPA games. (English)
Inf. Comput. 209, No. 8, 1160-1183 (2011).
7
Turn-based stochastic games. (English)
Apt, Krzysztof R. (ed.) et al., Lectures in game theory for computer scientists. Cambridge: Cambridge University Press (ISBN 978-0-521-19866-0/hbk). 146-184 (2011).
8
Demuth randomness and computational complexity. (English)
Ann. Pure Appl. Logic 162, No. 7, 504-513 (2011).
9
Efficient analysis of probabilistic programs with an unbounded counter. (English)
Gopalakrishnan, Ganesh (ed.) et al., Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22109-5/pbk). Lecture Notes in Computer Science 6806, 208-224 (2011).
10
Approximating the termination value of one-counter mdps and stochastic games. (English)
Comput. Res. Repos. 2011, Article No. 1104.4978 (2011).
11
Two views on multiple mean-payoff objectives in Markov decision processes. (English)
Comput. Res. Repos. 2011, Article No. 1104.3489 (2011).
12
Approximating the termination value of one-counter MDPs and stochastic games. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 332-343 (2011).
13
Runtime analysis of probabilistic programs with unbounded recursion. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 319-331 (2011).
14
Efficient analysis of probabilistic programs with an unbounded counter. (English)
Comput. Res. Repos. 2011, Article No. 1102.2529 (2011).
15
Measuring performance of continuous-time stochastic processes using timed automata. (English)
Comput. Res. Repos. 2011, Article No. 1101.4204 (2011).
16
Approximating the termination value of one-counter mdps and stochastic games (English)
ICALP (2), 332-343 (2011).
17
Runtime analysis of probabilistic programs with unbounded recursion (English)
ICALP (2), 319-331 (2011).
18
Efficient analysis of probabilistic programs with an unbounded counter (English)
CAV, 208-224 (2011).
19
Measuring performance of continuous-time stochastic processes using timed automata (English)
HSCC, 33-42 (2011).
20
Result 1 to 20 of 144 total
Start
Contact
Print
General Help
