Labelled Markov Processes: Stronger and faster approximations

Electronic Notes in Theoretical Computer Science

Volumn 87, Issue , 2004, Pages 157-203

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

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITÉ LAVAL   (Canada)

^c UNIVERSITY OF OXFORD   (United Kingdom)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

Approximation; Labelled Markov Processes; Probability theory

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; FORMAL LOGIC; MATHEMATICAL OPERATORS; PROBABILITY; STATE SPACE METHODS;

FINITE STATE SYSTEMS; LABELLED MARKOV PROCESSES; NUMERICAL PROPERTIES; PROBABILITY THEORY;

MARKOV PROCESSES;

EID: 23844529966     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.09.018     Document Type: Conference Paper

References (22)

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 Labelled Markov Processes. In Proceedings of the International Workshop on Fixed Points in Computer Science (FICS'03), pages 413-422, Warsaw, 2003.
5. th Symposium on Logic in Computer Science, pages 341-350, Ottawa, 2003. IEEE.
6. Vincent Danos, Josée Desharnais, and Prakash Panangaden. Conditional expectation and the approximation of labelled Markov processes. In CONCUR 2003 - Concurrency Theory, volume 2761 of Lecture Notes in Computer Science, pages 477 - 491. Springer-Verlag Heidelberg, December 2003.
7. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. Information and Computation, 179(2):163-193, Dec 2002.
8. Josée Desharnais. Labelled Markov Processes. PhD thesis, McGill University, November 1999.
9. Josée Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating labeled Markov processes. Information and Computation, 184(1):160-200, July 2003.
10. Josée Desharnais, Vineet Gupta, R. Jagadeesan, and Prakash Panangaden. Metrics for labeled Markov processes. In Proceedings of CONCUR99, Lecture Notes in Computer Science, pages 258-273. Springer-Verlag, 1999.
11. Josée Desharnais, Vineet Gupta, R. Jagadeesan, and Prakash Panangaden. Approximating continuous Markov processes. In Proceedings of the 15th Annual IEEE Symposium On Logic In Computer Science, Santa Barbara, Californie, USA, pages 95-106, 2000.
12. E.-E. Doberkat. Semi-pullbacks and bisimulations in categories of stochastic relations. In Proceedings of the 30th International Colloquium on Automata, Languages, and Programming (ICALP), number 2719 in Lecture Notes In Computer Science, pages 996-1007. Springer-Verlag, 2003.
13. 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.
14. Abbas Edalat. Domain theory and integration. Theoretical Computer Science, 151:163-193, 1995.
15. Masahito Hasegawa. Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In 3rd International Conference on Typed Lambda Calculi and Applications (TLCA'97), volume 1210 of LNCS, pages 196-213. Springer, 1997.
16. 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.
17. Keye Martin. The measurement process in domain theory. In International Colloquium on Automata, Languages and Programming, pages 116-126, 2000.
18. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes i and ii. Information and Computation, 100:1-77, 1992.
19. Prakash Panangaden and V. Shanbhogue. The expressive power of indeterminate dataflow primitives. Information and Computation, 98(1):99-131, 1992.
20. Franck van Breugel, Michael Mislove, Joël Ouaknine, and James Worrell. An intrinsic characterization of approximate probabilistic bisimilarity. In Proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), number 2620 in Lecture Notes In Computer Science, pages 200-215, 2003.
21. Franck van Breugel, Steven Shalit, and James Worrell. Testing labelled markov processes. In Proceedings of the 29th International Colloquium, on Automata, Languages, and Programming (ICALP), number 2380 in Lecture Notes In Computer Science, pages 537-548. Springer-Verlag, 2002.
22. David Williams. Probability with Martingales. CUP, Cambridge, 1991.