Metrics for labeled Markov systems. (English) Zbl 0939.68081
Baeten, Jos C. M. (ed.) et al., CONCUR ’99. Concurrency theory. 10th international conference, Eindhoven, the Netherlands, August 24-27, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1664, 258-273 (1999).
Summary: Partial labeled Markov chains (plMc) generalize process algebra and traditional Markov chains. They provide a foundation for interacting discrete probabilistic systems. Existing notions of process equivalence are too sensitive to the exact probabilities of transitions in plMcs. This paper studies more robust notions of “approximate” equivalence between plMcs.
For the entire collection see [Zbl 0921.00028].
For the entire collection see [Zbl 0921.00028].
MSC:
| 68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
