Abstract
This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes. In order to characterize the corresponding notion of rooted branching probabilistic bisimilarity, an equational theory is proposed for a basic, recursion-free process language with non-deterministic as well as probabilistic choice. The proof of completeness of the axiomatization builds on the completeness of strong probabilistic bisimilarity on the one hand and on the notion of a concrete process, i.e. a process that does not display (partially) inert \(\tau \)-moves, on the other hand. The approach is first presented for the non-deterministic fragment of the calculus and next generalized to incorporate probabilistic choice, too.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Andova, S., Georgievska, S.: On compositionality, efficiency, and applicability of abstraction in probabilistic systems. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 67–78. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-95891-8_10
Andova, S., Georgievska, S., Trcka, N.: Branching bisimulation congruence for probabilistic systems. Theoret. Comput. Sci. 413, 58–72 (2012)
Andova, S., Willemse, T.A.C.: Branching bisimulation for probabilistic systems: characteristics and decidability. Theoret. Comput. Sci. 356, 325–355 (2006)
Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science, vol. 50. CUP, Cambridge (2010)
Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci. 60, 187–231 (2000)
Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 370–381. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-48224-5_31
Bunte, O., et al.: The mCRL2 toolset for analysing concurrent systems. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 21–39. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-17465-1_2
Cattani, S., Segala, R.: Decision algorithms for probabilistic bisimulation*. In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 371–386. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45694-5_25
De Nicola, R., Vaandrager, F.W.: Three logics for branching bisimulation. J. ACM 42(2), 458–487 (1995)
Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.C.: Testing finitary probabilistic processes. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 274–288. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04081-8_19
Deng, Y., Palamidessi, C.: Axiomatizations for probabilistic finite-state behaviors. Theoret. Comput. Sci. 373, 92–114 (2007)
Deng, Y., Palamidessi, C., Pang, J.: Compositional reasoning for probabilistic finite-state behaviors. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 309–337. Springer, Heidelberg (2005). https://doi.org/10.1007/11601548_17
Eisentraut, C., Hermanns, H., Krämer, J., Turrini, A., Zhang, L.: Deciding bisimilarities on distributions. In: Joshi, K., Siegle, M., Stoelinga, M., D’Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 72–88. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40196-1_6
Ferrer Fioriti, L.M., Hashemi, V., Hermanns, H., Turrini, A.: Deciding probabilistic automata weak bisimulation: theory and practice. Formal Aspects Comput. 28, 09–143 (2016)
Fisher, N., van Glabbeek, R.J.: Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours. J. Logical Algebraic Methods Program. 102, 64–102 (2019)
van Glabbeek, R.J., Groote, J.F., de Vink, E.P.: A complete axiomatization of branching bisimilarity for a simple process language with probabilistic choice. Technical report, Eindhoven University of Technology (2019). http://rvg.web.cse.unsw.edu.au/pub/AxiomProbBranchingBis.pdf
van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43, 555–600 (1996)
Groote, J.F., Jansen, D.N., Keiren, J.J.A., Wijs, A.: An O(m log n) algorithm for computing stuttering equivalence and branching bisimulation. ACM Trans. Comput. Logic 18(2), 13:1–13:34 (2017)
Groote, J.F., Vaandrager, F.: An efficient algorithm for branching bisimulation and stuttering equivalence. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 626–638. Springer, Heidelberg (1990). https://doi.org/10.1007/BFb0032063
Groote, J.F., Rivera Verduzco, H.J., de Vink, E.P.: An efficient algorithm to determine probabilistic bisimulation. Algorithms 11(9), 131, 1–22 (2018)
Groote, J.F., de Vink, E.P.: Problem solving using process algebra considered insightful. In: Katoen, J.-P., Langerak, R., Rensink, A. (eds.) ModelEd, TestEd, TrustEd. LNCS, vol. 10500, pp. 48–63. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68270-9_3
Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: Proceedings of the RTSS 1990, pp. 278–287. IEEE (1990)
Hennessy, M.: Exploring probabilistic bisimulations, part I. Formal Aspects Comput. 24, 749–768 (2012)
Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299–309. Springer, Heidelberg (1980). https://doi.org/10.1007/3-540-10003-2_79
Lee, M.D., de Vink, E.P.: Logical characterization of bisimulation for transition relations over probability distributions with internal actions. In: Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.) Proceedings of the MFCS 2016. LIPIcs, vol. 58, pp. 29:1–29:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)
Milner, R.: A complete axiomatization for observational congruence of finite-state behaviours. Inf. Comput. 81(2), 227–247 (1989)
Segala, R.: Modeling and verification of randomized distributed real-time systems. PhD thesis, MIT (1995). Technical report MIT/LCS/TR-676
Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 481–496. Springer, Heidelberg (1994). https://doi.org/10.1007/978-3-540-48654-1_35
Stoelinga, M.: Alea Jacta est: verification of probabilistic, real-time and parametric systems. Ph.D. thesis, Radboud Universiteit (2002)
Turrini, A., Hermanns, H.: Polynomial time decision algorithms for probabilistic automata. Inf. Comput. 244, 134–171 (2015)
Valmari, A.: Simple bisimilarity minimization in O(m log n) time. Fundam. Inf. 105(3), 319–339 (2010)
Valmari, A., Franceschinis, G.: Simple O(m log n) time Markov chain lumping. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 38–52. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12002-2_4
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
van Glabbeek, R.J., Groote, J.F., de Vink, E.P. (2019). A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice. In: Alvim, M., Chatzikokolakis, K., Olarte, C., Valencia, F. (eds) The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy. Lecture Notes in Computer Science(), vol 11760. Springer, Cham. https://doi.org/10.1007/978-3-030-31175-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-31175-9_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31174-2
Online ISBN: 978-3-030-31175-9
eBook Packages: Computer ScienceComputer Science (R0)