Metrics for labelled Markov processes

Theoretical Computer Science

Volumn 318, Issue 3, 2004, Pages 323-354

  Desharnais, Josée ^a   Gupta, Vineet ^b   Jagadeesan, Radha ^c   Panangaden, Prakash ^d  

^a UNIVERSITÉ LAVAL   (Canada)

^b GOOGLE INC   (United States)

^c DEPAUL UNIVERSITY   (United States)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

Labelled Markov processes; Metric; Process Algebra

Indexed keywords

ALGEBRA; DATA REDUCTION; HEURISTIC METHODS; LINEAR PROGRAMMING; MATRIX ALGEBRA; MAXWELL EQUATIONS; PROBABILITY; STATISTICAL MECHANICS;

BISIMULATION; LABELLED MARKOV PROCESSES; METRIC; PROCESS ALGEBRA;

MARKOV PROCESSES;

EID: 2442553673     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.09.013     Document Type: Article

References (54)

1. R. Alur, L. Jagadeesan, J.J. Kott, J.E. von Olnhausen, Model-checking of real-time systems: a telecommunications application, in: Proc. 19th Internat. Conf. on Software Engineering, Boston, Massachusetts, USA, 1997, pp. 514-524.
2. Baeten J.C.M., Bergstra J.A., Smolka S.A. Axiomatizing probabilistic processes. ACP with generative probabilities Inform. Comput. 121(2):1995;234-255.
3. C. Baier, E. Clark, V. Hartonas-Garmhausen, M. Kwiatkowska, M. Ryan, Symbolic model checking for probabilistic processes, in: Proc. 24th Internat. Coll. on Automata Languages and Programming, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 430-440.
4. Bengtsson J., Larsen K.G., Larsson F., Pettersson P., Yi W. UppAal. a tool suite for automatic verification of real-time systems Alur R., Henzinger T., Sontag E. Hybrid Systems III. Lecture Notes in Computer Science. Vol. 1066:1996;232-243 Springer, Berlin.
5. Bianco A., de Alfaro L. Model checking of probabilistic and nondeterministic systems. Thiagarajan P.S. Proc. 15th Ann. Conf. on Foundations of Software Technology and Theoretical Computer Science Lecture Notes in Computer Science. Vol. 1026:1995;499-513 Springer, Berlin.
6. R. Blute, J. Desharnais, A. Edalat, P. Panangaden, Bisimulation for labelled Markov processes, in: Proc. 12th IEEE Symp. on Logic in Computer Science, Warsaw, Poland, 1997.
7. Cleaveland R., Smolka S., Zwarico A. Testing preorders for probabilistic processes. Kuich W. Automata, Languages and Programming (ICALP 92). Lecture Notes in Computer Science. Vol. 623:1992;708-719 Springer, Berlin.
8. Courcoubetis C., Yannakakis M. The complexity of probabilistic verification. J. ACM. 42(4):1995;857-907.
9. Cover T., Thomas J. Elements of Information Theory. 1991;Wiley, New York.
10. L. de Alfaro, private communication.
11. J. de Kleer, B.C. Williams, Diagnosis with behavioral modes, in: Proc. 11th Internat. Joint Conf. on Artificial Intelligence, Detroit, Michigan, USA, August 1989, pp. 1324-1330.
12. J. Desharnais, Labelled Markov processes, Ph.D. Thesis, McGill University, November 1999.
13. J. Desharnais, Logical characterization of simulation for Markov chains, in: M. Kwiatkowska (Ed.), Probmiv99, Proc. Second Internat. Workshop on Probabilistic Methods in Verification, The University of Birmingham, 1999, pp. 33-48, available as TR: CSR-99-8.
14. J. Desharnais, A. Edalat, P. Panangaden, A logical characterization of bisimulation for labelled Markov processes, in: Proc. 13th IEEE Symp. on Logic in Computer Science, Indianapolis, IEEE Press, New York, June 1998, pp. 478-489.
15. Desharnais J., Edalat A., Panangaden P. Bisimulation for labeled Markov processes. Inform. Comput. 179(2):2002;163-193.
16. J. Desharnais, V. Gupta, R. Jagadeesan, P. Panangaden, Metrics for labeled Markov systems, in: Proc. CONCUR99, Lecture Notes in Computer Science, Springer, Berlin, 1999.
17. J. Desharnais, V. Gupta, R. Jagadeesan, P. Panangaden, Approximation of labeled Markov processes, in: Proc. 15th Ann. IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, June 2000, pp. 95-106.
18. J. Desharnais, V. Gupta, R. Jagadeesan, P. Panangaden, The metric analogue of weak bisimulation for labelled Markov processes, in: Proc. 17th Ann. IEEE Symp. on Logic in Computer Science, Copenhagen, Denmark, July 2002, pp. 413-422.
19. Desharnais J., Gupta V., Jagadeesan R., Panangaden P. Approximating labeled Markov processes. Inform. Comput. 184(1):2003;160-200.
20. de Vink E., Rutten J.J.M.M. Bisimulation for probabilistic transition systems. a coalgebraic approach Theoret. Comput. Sci. 221(1/2):1999;271-293.
21. Devroye L., Györfi L., Lugosi G. A Probabilistic Theory of Pattern Recognition. 1996;Springer, Berlin.
22. Dill D. Trace theory for automatic hierarchical verification of speed-independent circuits, ACM Distinguished Dissertations. 1988;MIT Press, Cambridge, MA.
23. Edgar G.A. Integral, Probability and Fractal Measures. 1998;Springer, Berlin.
24. Geroch R. Mathematical Physics. Chicago Lectures in Physics. 1985;University of Chicago Press, Chicago.
25. A. Giacalone, C. Jou, S. Smolka, Algebraic reasoning for probabilistic concurrent systems, in: Proc. Working Conf. Programming Concepts and Methods, IFIP TC2, Sea of Galilee, Israel, 1990.
26. Gupta V., Henzinger T.A., Jagadeesan R. Robust timed automata. Maler O. Hybrid and Real-Time Systems. Lecture Notes in Computer Science. Vol. 1201:March 1997;331-345 Springer, Berlin.
27. H. Hansson, B. Jonsson, A calculus for communicating systems with time and probabilities, in: Proc. 11th IEEE Real-time Systems Symp., IEEE Computer Society Press, Silver Spring, MD, 1990, pp. 278-287.
28. Hart S., Sharir M. Probabilistic propositional temporal logics. Inform. Control. 70:1986;97-155.
29. J. Hillston, A compositional approach to performance modelling, Ph.D. Thesis, University of Edinburgh, 1994 (Published as a Distinguished Dissertation by Cambridge University Press in 1996).
30. Hutchinson J.E. Fractals and self-similarity. Indiana Univ. Math. J. 30:1981;713-747.
31. M. Huth, M. Kwiatkowska, Quantitative analysis and model checking, in: Proc. 12 IEEE Symp. on Logic in Computer Science, IEEE Press, New York, 1997, pp. 111-122.
32. C. Jones, G.D. Plotkin, A probabilistic powerdomain of evaluations, in: Proc. Fourth Ann. IEEE Symp. on Logic in Computer Science, Asilomar, California, USA, 1989, pp. 186-195.
33. B. Jonsson, W. Yi, Compositional testing preorders for probabilistic processes, in: Proc. 10th Ann. IEEE Symp. on Logic in Computer Science, San Diego, California, USA, 1995, pp. 431-441.
34. Josephs M.B. Receptive process theory. Acta Inform. 29(1):1992;17-31.
35. Jou C.-C., Smolka S.A. Equivalences, congruences, and complete axiomatizations for probabilistic processes. Baeten J.C.M., Klop J.W. CONCUR 90 First Internat. Conf. on Concurrency Theory. Lecture Notes in Computer Science. Vol. 458:1990;Springer, Berlin.
36. Kozen D. A probabilistic PDL. J. Comput. Systems Sci. 30(2):1985;162-178.
37. Kwiatkowska M., Norman G.J. Probabilistic metric semantics for a simple language with recursion. Penczek W., Szalas A. Proc. 21st Internat. Symp. on Math. Foundations of Computer Science. Lecture Notes in Computer Science. Vol. 1113:1996;419-430 Springer, Berlin.
38. Kwiatkowska M., Norman G.J. A testing equivalence for reactive probabilistic processes. Castelliani I., Palamidessi C. Proc. Fifth Internat. Workshop on Expressiveness in Concurrency. Electronic Notes in Theoretical Computer Science. Vol. 16:1998;Elsevier, Amsterdam.
39. Larsen K.G., Skou A. Bisimulation through probablistic testing. Inform. Comput. 94:1991;1-28.
40. P.D. Lincoln, J.C. Mitchell, M. Mitchell, A. Scedrov, A probabilistic poly-time framework for protocol analysis, in: Proc. of the 5th ACM Conference on Computer and Communication Security (CCS-5), San Francisco, 1998, pp. 112-121.
41. Lynch N.A., Tuttle M.R. An introduction to input/output automata. CWI Quart. 2(3):1989;219-246.
42. M.A. Marsan, Stochastic petri nets: an elementary introduction, in: Advances in Petri Nets 1989, Springer, Berlin, 1989, pp. 1-29.
43. Parthasarathy K.R. Probability Measures on Metric Spaces. 1967;Academic Press, New York.
44. Peterson J.L., Silberschatz A. Operating System Concepts. 1985;Addison-Wesley Inc. Reading, MA.
45. R. Segala, Modeling and verification of randomized distributed real-time systems, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, 1995, Also appears as Technical Report MIT/LCS/TR-676.
46. F.W. Vaandrager, On the relationship between process algebra and input/output automata, in: Proc. Sixth Ann. IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, July 1991, pp. 387-398.
47. F. van Breugel, private communication.
48. van Breugel, private communication.
49. F. van Breugel, M. Mislove, J. Ouaknine, J. Worrell, An intrinsic characterization of approximate probabilistic bisimilarity, in: Proc. FOSSACS 03, Lecture Notes in Computer Science, Vol. 2620, Springer, Berlin, 2003.
50. van Breugel F., Worrell J. An algorithm for quantitative verification of probabilistic systems. Larsen K.G., Nielsen M. Proc. 12th Internat. Conf. on Concurrency Theory - CONCUR'01. Lecture Notes in Computer Science. Vol. 2154:2001;336-350 Springer, Berlin.
51. F. van Breugel, J. Worrell, Towards quantitative verification of probabilistic systems, in: Proc. 28th Internat. Coll. on Automata, Languages and Programming. Springer, Berlin, 2001.
52. van Glabbeek R., Smolka S.A., Steffen B.U. Reactive, generative, and stratified models of probabilistic processes. Inform. Comput. 121(1):1995;59-80.
53. Viswanadham N., Narahari Y. Performance Modeling of Automated Manufacturing Systems. 1992;Prentice-Hall Inc. Englewood Cliffs, NJ.
54. Wu S.-H., Smolka S.A., Stark E.W. Composition and behaviors for probabilistic I/O automata. Theoret. Comput. Sci. 176(1-2):1997;1-36.