Abstract
We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the main behavioural relations on probabilistic nondeterministic processes, can be characterized by abstract interpretation. Both bisimulation and simulation can be obtained as completions of partitions and preorders, viewed as abstract domains, w.r.t. a pair of concrete functions that encode a PLTS. This approach provides a general framework for designing algorithms that compute bisimulation and simulation on PLTSs. Notably, (i) we show that the standard bisimulation algorithm by Baier et al. (2000) can be viewed as an instance of such a framework and (ii) we design a new efficient simulation algorithm that improves the state of the art.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baier C, Engelen B, Majster-Cederbaum M (2000) Deciding bisimilarity and similarity for probabilistic processes. J Comput Syst Sci 60:187–231
Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc 4th ACM POPL, pp 238–252
Cousot P, Cousot R (1979) Systematic design of program analysis frameworks. In: Proc 6th ACM POPL, pp 269–282
Crafa S, Ranzato F (2011) Probabilistic bisimulation and simulation algorithms by abstract interpretation. In: Proc ICALP’11. Springer LNCS, vol 6756, pp 295–306
Desharnais J (1999) Labelled Markov processes. PhD thesis, McGill Univ
Desharnais J, Edalat A, Panangaden P (2002) Bisimulation for labelled Markov processes. Inf Comput 179:163–193
Giacobazzi R, Quintarelli E (2001) Incompleteness, counterexamples and refinements in abstract model checking. In: Proc 8th SAS. Springer LNCS, vol 2126, pp 356–373
Giacobazzi R, Ranzato F (1997) Refining and compressing abstract domains. In: Proc 24th ICALP. Springer LNCS, vol 1256, pp 771–781
Henzinger MR, Henzinger TA, Kopke PW (1995) Computing simulations on finite and infinite graphs. In: Proc 36th FOCS, pp 453–462
Larsen KG, Skou A (1991) Bisimulation through probabilistic testing. Inf Comput 94(1):1–28
Paige R, Tarjan RE (1987) Three partition refinement algorithms. SIAM J Comput 16(6):973–989
Parma A, Segala R (2007) Logical characterizations of bisimulations for discrete probabilistic systems. In: Proc FOSSACS’07. Springer LNCS, vol 4423, pp 287–301
Ranzato F, Tapparo F (2007) A new efficient simulation equivalence algorithm. In: Proc IEEE LICS’07, pp 171–180
Ranzato F, Tapparo F (2007) Generalized strong preservation by abstract interpretation. J Log Comput 17(1):157–197
Ranzato F, Tapparo F (2010) An efficient simulation algorithm based on abstract interpretation. Inf Comput 208(1):1–22
Segala R, Lynch N (1995) Probabilistic simulations for probabilistic processes. Nord J Comput 2(2):250–273
van Glabbeek RJ, Smolka S, Steffen B, Tofts C (1990) Reactive, generative and stratified models for probabilistic processes. In: Proc IEEE LICS’90, pp 130–141
Zhang L (2008) A space-efficient probabilistic simulation algorithm. In: Proc CONCUR’08. Springer LNCS, vol 5201, pp 248–263
Zhang L (2009) Decision algorithms for probabilistic simulations. PhD thesis, Univ des Saarlandes
Zhang L, Hermanns H, Eisenbrand F, Jansen DN (2008) Flow faster: efficient decision algorithms for probabilistic simulations. Log Methods Comput Sci 4(4)
Acknowledgements
We are grateful to D.N. Jansen for his valuable comments, especially on the implementation of the algorithm. This work was partially supported by the University of Padova under the projects “AVIAMO” and “BECOM”.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Crafa, S., Ranzato, F. Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation. Form Methods Syst Des 40, 356–376 (2012). https://doi.org/10.1007/s10703-012-0147-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10703-012-0147-3