Approximating Markov processes through filtration

Elsevier Inc
Publication Type:
Journal Article
Theoretical Computer Science, 2012, 446 pp. 75 - 97
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2012001821OK.pdf363.41 kB
Adobe PDF
In this paper, we define a probabilistic version of filtration and use it to provide a finite approximation of Markov processes. In order to measure the approximation, we employ probability logic to construct the final Markov process and define a metric on the set of Markov processes through this logic. Moreover, we show that the set endowed with this metric is a Polish space. Finally we point to some questions connecting approximation to uniformity and approximate bisimilarity as topics for future research.
Please use this identifier to cite or link to this item: