Approximating Markov processes through filtration

Zhou, C; Ying, M

Approximating Markov processes through filtration

Zhou, C Ying, M

Permalink

Publication Type:: Journal Article
Citation:: Theoretical Computer Science, 2012, 446 pp. 75 - 97
Issue Date:: 2012-08-10

Closed Access

	Filename	Description	Size
	2012001821OK.pdf		363.41 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhou, C	en_US
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X	en_US
dc.date.issued	2012-08-10	en_US
dc.identifier.citation	Theoretical Computer Science, 2012, 446 pp. 75 - 97	en_US
dc.identifier.issn	0304-3975	en_US
dc.identifier.uri	http://hdl.handle.net/10453/22876
dc.description.abstract	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. © 2012 Elsevier B.V. All rights reserved.	en_US
dc.relation.ispartof	Theoretical Computer Science	en_US
dc.relation.isbasedon	10.1016/j.tcs.2012.03.026	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Approximating Markov processes through filtration	en_US
dc.type	Journal Article
utslib.citation.volume	446	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0105 Mathematical Physics	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	08 Information and Computing Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	446	en_US

Abstract:

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. © 2012 Elsevier B.V. All rights reserved.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/22876