Symbolic Magnifying Lens Abstraction in Markov Decision Processes Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA 1 Oxford University Computing Labor

First Page		Document Content
Date: 2008-07-01 03:47:28 Mathematics Dynamic programming Markov decision process Stochastic control Probability Mathematical analysis Reachability		Symbolic Magnifying Lens Abstraction in Markov Decision Processes Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA 1 Oxford University Computing Labor Add to Reading List Source URL: qav.comlab.ox.ac.uk Download Document from Source Website File Size: 229,32 KB Share Document on Facebook

	Reachability in Recursive Markov Decision Processes? Tom´ aˇs Br´ azdil, V´ aclav Broˇzek, Vojtˇech Forejt, and Anton´ın Kuˇcera DocID: 1xW2m - View Document
	Reachability Analysis of Deep Neural Networks with Provable Guarantees Wenjie Ruan1 , Xiaowei Huang2 , Marta Kwiatkowska1 Department of Computer Science, University of Oxford, UK 2 Department of Computer Science, Univers DocID: 1xW0E - View Document
	Towards Personalized Cancer Therapy Using Delta-Reachability Analysis∗ Bing Liu Soonho Kong DocID: 1xVOI - View Document
	Symbolic Optimal Expected Time Reachability Computation and Controller Synthesis for Probabilistic Timed Automata Aleksandra Jovanovi´ca , Marta Kwiatkowskaa , Gethin Normanb , Quentin Peyrasc a Department DocID: 1xVlv - View Document
	LIPIcs Leibniz International Proceedings in Informatics Continuous-Time Stochastic Games with Time-Bounded Reachability DocID: 1xVbZ - View Document