Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

Second International Conference on the Quantitative Evaluation of Systems (QEST'05)   pp. 54-62
An approximation algorithm for labelled Markov processes: towards realistic approximation

Full Article Text: Download PDF of full textBuy this article

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/QEST.2005.4
Send link to a friend

Abstract
Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not been clear whether this scheme could be used in practice since it involves inverting a stochastic kernel.We describe aMonte-Carlobased implementation scheme for this approximation algorithm. This is, to the best of our knowledge, the first implementation of this approximation scheme. The implementation involves some novel ideas about how to estimate infs using sampling and also replacing the explicit description of subsets of the state space by tests for membership. It is hoped that this work will enable more applications of continuous probabilistic LMP theory to emerge.
Additional Information

Citation:  Alexandre Bouchard-Cote, Norm Ferns, Prakash Panangaden,, Doina Precup, "An approximation algorithm for labelled Markov processes: towards realistic approximation," qest, pp. 54-62,  Second International Conference on the Quantitative Evaluation of Systems (QEST'05),  2005

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback