Abstract
By taking the symmetric form of simulation preorder, we obtain a notion of weak probabilistic bisimulation. It provides a sound and complete proof methodology for an extensional behavioural equivalence, a probabilistic variant of the traditional reduction barbed congruence.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Deng, Y., Hennessy, M.: On the semantics of Markov automata. Inf. Comput. 222, 139–168 (2013)
Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, pp. 342–351. IEEE Computer Society (2010)
Hennessy, M.: Exploring probabilistic bisimulations, part I. Form. Asp. Comput. 24(4–6), 749–768 (2012)
Eisentraut, C., Hermanns, H., Krämer, J., Turrini, A., Zhang, L.: Deciding bisimilarities on Distributions. Proceedings of the 10th International Conference on Quantitative Evaluation of Systems, Lecture Notes in Computer Science, vol. 8054, pp. 72–88. Springer (2013)
Cattani, S., Segala, R.: Decision Algorithms for Probabilistic Bisimulation. Proceedings of the 13th International Conference on Concurrency Theory, Lecture Notes in Computer Science, vol. 2421, pp. 371–385. Springer (2002)
Rathke, J., Sobocinski, P.: Making the unobservable, unobservable. Electron. Notes Comput. Sci. 229(3), 131–144 (2009)
Honda, K., Yoshida, N.: On reduction-based process semantics. Theoret. Comput. Sci. 151(2), 437–486 (1995)
Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. Log. Methods Comput. Sci. 1(1:4) (2005)
Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. Proceedings of the 22nd IEEE Symposium on Logic in Computer Science, pp. 293–302. IEEE Computer Society (2007)
Rathke, J., Sobocinski, P.: Deriving structural labelled transitions for mobile ambients. Proceedings of the 19th International Conference on Concurrency Theory, Lecture Notes in Computer Science, vol. 5201, pp. 462–476. Springer (2008)
Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. J. Log. Algebraic Program. 63(1), 131–173 (2005)
Sangiorgi, D., Walker, D.: The π-Calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Shanghai Jiao Tong University Press, Shanghai and Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Deng, Y. (2014). Weak Probabilistic Bisimulation. In: Semantics of Probabilistic Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45198-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-45198-4_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45197-7
Online ISBN: 978-3-662-45198-4
eBook Packages: Computer ScienceComputer Science (R0)