© The AuthorPublished by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: Advance Access published on May

First Page		Document Content
Date: 2006-03-03 11:39:52 Statistical randomness Queueing theory Mathematics Markov models Probability theory Process calculi PEPA Markov processes Markov chain Product-form solution Balance equation Jane Hillston		© The AuthorPublished by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: Advance Access published on May Add to Reading List Source URL: www.dcs.ed.ac.uk Download Document from Source Website File Size: 262,19 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
	Solvency Markov Decision Processes with Interest Tomáš Brázdil∗1 , Taolue Chen2 , Vojtěch Forejt†3 , Petr Novotný1 , and Aistis Simaitis3 1 2 3 DocID: 1xVLS - View Document
	Specification Revision for Markov Decision Processes with Optimal Trade-off M. Lahijanian and M. Kwiatkowska Abstract— Optimal control policy synthesis for probabilistic systems from high-level specifications is increa DocID: 1xVDa - View Document
	Strategy Synthesis for Markov Decision Processes and Branching-Time Logics Tom´asˇ Br´azdil⋆ and Vojtˇech Forejt⋆⋆ Faculty of Informatics, Masaryk University, Botanick´a 68a, 60200 Brno, Czech Republic. DocID: 1xVy7 - View Document
	Process algebra and Markov processes The nature of synchronisation Equivalence relations Case study: active badges Summary From Markov to Milner and back: Stochastic process algebras Jane Hillston School of Informatics DocID: 1xVg5 - View Document