Probabilistic Bisimulation - Semantics of Probabilistic Processes: An Operational Approach - page 67

52. Tarski, A.: A lattice-theoretical fixpoint theorem and its application. Pac. J. Math. 5 , 285-309
(1955)
53. Steffen, B., Ingólfsdóttir, A.: Characteristic formulae for processes with divergence. Inf.
Comput. 110 , 149-163 (1994)
54. Müller-Olm, M.: Derivation of characteristic formulae. Electron. Notes Theor. Comput. Sci.
18 , 159-170 (1998)
55. van Breugel, F., Worrell, J.: Towards quantitative verification of probabilistic transition systems.
Proceedings of the 28th International Colloquium on Automata, Languages and Programming.
Lecture Notes in Computer Science, vol. 2076, pp. 421-432. Springer, Heidelberg (2001)
56. Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak
bisimulation for probabilistic processes. Proceedings of the 17th Annual IEEE Symposium on
Logic in Computer Science, pp. 413-422. IEEE Computer Society (2002)
57. Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: Metrics for labelled markov
processes. Theor. Comput. Sci. 318 (3), 323-354 (2004)
58. Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press, Cambridge (2008)
59. Kanellakis, P., Smolka, S.A.: CCS expressions, finite state processes, and three problems of
equivalence. Inf. Comput. 86 (1), 43-65 (1990)
60. Cheriyan, J., Hagerup, T., Mehlhorn, K.: Can a maximum flow be computed on O(nm) time?
Proceedings of the 17th International Colloquium on Automata, Languages and Programming.
Lecture Notes in Computer Science, vol. 443, pp. 235-248. Springer, Heidelberg (1990)
61. Lin, H.: “On-the-fly” instantiation of value-passing processes. Proceedings of FORTE'98, IFIP
Conference Proceedings, vol. 135, pp. 215-230. Kluwer (1998)
62. Fernandez, J.C., Mounier, L.: Verifying bisimulations “on the fly”. Proceedings of the 3rd
International Conference on Formal Description Techniques for Distributed Systems and
Communication Protocols, pp. 95-110. North-Holland (1990)
63. Deng, Y., Du, W.: A local algorithm for checking probabilistic bisimilarity. Proceedings of the
4th International Conference on Frontier of Computer Science and Technology, pp. 401-409.
IEEE Computer Society (2009)
64. Rabin, M.O.: Probabilistic automata. Inf. Control 6 , 230-245 (1963)
65. Derman, C.: Finite State Markovian Decision Processes. Academic, New York (1970)
66. Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. Proceedings
26th Annual Symposium on Foundations of Computer Science, pp. 327-338 (1985)
67. Jones, C., Plotkin, G.: A probabilistic powerdomain of evaluations. Proceedings of the 4th
Annual IEEE Symposium on Logic in Computer Science, pp. 186-195. Computer Society
Press (1989)
68. van Glabbeek, R., Smolka, S.A., Steffen, B., Tofts, C.: Reactive, generative, and stratified
models of probabilistic processes. Proceedings of the 5th Annual IEEE Symposium on Logic
in Computer Science, pp. 130-141. Computer Society Press (1990)
69. Jonsson, B., Ho-Stuart, C., Yi, W.: Testing and refinement for nondeterministic and probabilistic
processes. Proceedings of the 3rd International Symposium on Formal Techniques in Real-
Time and Fault-Tolerant Systems. Lecture Notes in Computer Science, vol. 863, pp. 418-430.
Springer, Heidelberg (1994)
70. Jonsson, B., Yi, W.: Compositional testing preorders for probabilistic processes. Proceedings
of the 10th Annual IEEE Symposium on Logic in Computer Science, pp. 431-441. Computer
Society Press (1995)
71. Puterman, M.L.: Markov Decision Processes. Wiley, New York (1994)
72. Crafa, S., Ranzato, F.: A spectrum of behavioral relations over LTSs on probability distributions.
Proceedings the 22nd International Conference on Concurrency Theory. Lecture Notes in
Computer Science, vol. 6901, pp. 124-139. Springer, Heidelberg (2011)
73. Hennessy, M.: Exploring probabilistic bisimulations, part I. Form. Asp. Comput. 24 (4-6),
749-768 (2012)
74. Feng, Y., Zhang, L.: When equivalence and bisimulation join forces in probabilistic au-
tomata. Proceedings of the 19th International Symposium on Formal Methods. Lecture Notes
in Computer Science, vol. 8442, pp. 247-262. Springer, Heidelberg (2014)