Conditional expectation and the approximation of labelled Markov processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2761, Issue , 2003, Pages 477-491

  Danos, Vincent ^a   Desharnais, Josée ^b   Panangaden, Prakash ^c  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITÉ LAVAL   (Canada)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMANTS; COARSE GRAINING; CONDITIONAL EXPECTATION; CUSTOMIZABLE; LABELLED MARKOV PROCESS; TRANSITION PROBABILITIES;

MARKOV PROCESSES;

EID: 35248891881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_31     Document Type: Article

References (16)

1. W. Arveson. An Invitation to C*-Algebra. Springer-Verlag, 1976.
2. G. Choquet. Theory of capacities. Ann. Inst. Fourier (Grenoble), 5:131-295, 1953.
3. Vincent Danos and Josée Desharnais. Note sur les chaînes de Markov étiquetées. Unpublished (in french), 2002.
4. Vincent Danos and Josée Desharnais. A fixpoint logic for labeled Markov Processes. In Zoltan Esik and Igor Walukiewicz, editors, Proceedings of an international Workshop FICS'03 (Fixed Points in Computer Science), Warsaw, 2003.
5. th Symposium on Logic in Computer Science, Ottawa, 2003. IEEE.
6. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. Information and Computation, 179(2):163-193, Dec 2002. Available from http://www.ift.ulaval.ca/~jodesharnais.
7. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov processes. In Proceedings of CONCUR99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
8. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating continuous Markov processes. In Proceedings of the 15th Annual IEEE Symposium On Logic In Computer Science, Santa Barbara, Californie, USA, 2000. pp. 95-106.
9. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating labeled Markov processes. Information and Computation, 2003. To appear. Available from http://www.ift.ulaval.ca/~jodesharnais.
10. Abbas Edalat. Domain of computation of a random field in statistical physics. In C. Hankin, I. Mackie, and R. Nagarajan, editors, Theory and Formal Methods 1994: Proceedings of the second Imperial College Department of Computing Workshop on Theory and Formal Methods, pages 11-14. IC Press, 1994.
11. Abbas Edalat. Domain theory and integration. Theoretical Computer Science, 151:163-193, 1995.
12. C. Jones and G. D. Plotkin. A probabilistic powerdomain of evaluations. In Proceedings of the Fourth Annual IEEE Symposium On Logic In Computer Science, pages 186-195, 1989.
13. Keye Martin. The measurement process in domain theory. In International Colloquium on Automata, Languages and Programming, pages 116-126, 2000.
14. P. Panangaden and V. Shanbhogue. The expressive power of indeterminate dataflow primitives. Information and Computation, 98(1):99-131, 1992.
15. Franck van Breugel, Michael Mislove, Joël Ouaknine, and James Worrell. Probabilistic simulation, domain theory and labelled Markov processes. To appear in the Proceedings of FOSSACS'03, 2003.
16. David Williams. Probability with Martingales. CUP, Cambridge, 1991.