DocumentCode
3293785
Title
Domain theory in stochastic processes
Author
Edalat, Abbas
Author_Institution
Dept. of Comput., Imperial Coll. of Sci., Technol. & Med., London, UK
fYear
1995
fDate
26-29 Jun 1995
Firstpage
244
Lastpage
254
Abstract
We establish domain-theoretic models of finite-state discrete stochastic processes, Markov processes and vector recurrent iterated function systems. In each case, we show that the distribution of the stochastic process is canonically obtained as the least upper bound of an increasing chain of simple valuations in a probabilistic power domain associated to the process. This leads to various formulas and algorithms to compute the expected values of functions which are continuous almost everywhere with respect to Me distribution of the stochastic process. We prove the existence and uniqueness of the invariant distribution of a vector recurrent iterated function system which is used in fractal image compression. We also present a finite algorithm to decode the image
Keywords
Markov processes; data compression; finite automata; fractals; image coding; Markov processes; domain-theoretic models; finite algorithm; finite-state discrete stochastic processes; fractal image compression; probabilistic power domain; vector recurrent iterated function system; vector recurrent iterated function systems; Application software; Computer science; Distributed computing; Image coding; Iterative decoding; Markov processes; Mathematics; Space stations; Stochastic processes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1995. LICS '95. Proceedings., Tenth Annual IEEE Symposium on
Conference_Location
San Diego, CA
ISSN
1043-6871
Print_ISBN
0-8186-7050-9
Type
conf
DOI
10.1109/LICS.1995.523260
Filename
523260
Link To Document