Abstract
We present and compare several algorithms for computing the maximal strong bisimulation, the maximal divergence-respecting delay bisimulation, and the maximal divergence-respecting weak bisimulation of a generalised labelled transition system. These bisimulation relations preserve CSP semantics, as well as the operational semantics of programs in other languages with operational semantics described by such GLTSs and relying only on observational equivalence. They can therefore be used to combat the space explosion problem faced in explicit model checking for such languages. We concentrate on algorithms which work efficiently when implemented rather than on ones which have low asymptotic growth.
Similar content being viewed by others
References
Armstrong P, Goldsmith M, Lowe G, Ouaknine J, Palikareva H, Roscoe AW, Worrell J (2012) Recent developments in FDR. In: Computer aided verification. Springer, pp 699–704
Boulgakov A, Gibson-Robinson T, Roscoe AW (2014) Computing maximal bisimulations. In: Formal methods and software engineering. Springer, pp 11–26
Blom S, Orzan S (2002) A distributed algorithm for strong bisimulation reduction of state spaces. Electron Notes Theor Comput Sci 68(4): 523–538
Blom S, Orzan S (2005) Distributed state space minimization. Int J Softw Tools Technol Transf 7(3): 280–291
Blom S, van de Pol J (2009) Distributed branching bisimulation minimization by inductive signatures. arXiv preprint arXiv:0912.2550
Dovier A, Piazza C, Policriti A (2004) An efficient algorithm for computing bisimulation equivalence. Theor Comput Sci 311(1): 221–256
Fernandez J-C (1990) An implementation of an efficient algorithm for bisimulation equivalence. Sci Comput Program 13(2): 219–236
Floyd RW (1962) Algorithm 97: Shortest path. Commun ACM 5(6): 345
Garavel H, Lang F, Mateescu R, Serwe W (2013) CADP 2011: a toolbox for the construction and analysis of distributed processes. Int J Softw Tools Technol Transf 15(2): 89–107
Gibson-Robinson T, Armstrong P, Boulgakov A, Roscoe AW (2015) FDR3: a parallel refinement checker for CSP. Int J Softw Tools Technol Transf 1–19
Groote JF, Vaandrager F (1990) An efficient algorithm for branching bisimulation and stuttering equivalence. In: Paterson MS (ed) Automata, languages and programming, volume 443 of Lecture notes in computer science. Springer, Berlin, pp 626–638
Hoare CAR (1985) Communicating sequential processes. Prentice-Hall, Inc., Upper Saddle River
Kanellakis PC, Smolka SA (1983) CCS expressions, finite state processes, and three problems of equivalence. In: Proceedings of the 2nd annual ACM symposium on principles of distributed computing, PODC ’83, pp 228–240, New York, NY, USA, ACM
Mateescu R (2005) On-the-fly state space reductions for weak equivalences. In: Proceedings of the 10th international workshop on formal methods for industrial critical systems, pp 80–89 ACM
Milner R (1981) A modal characterisation of observable machine-behaviour. In: CAAP’81. Springer, pp 25–34
Park D (1981) Concurrency and automata on infinite sequences. Springer, Berlin
Paige R, Tarjan RE (1987) Three partition refinement algorithms. SIAM J Comput 16(6): 973–989
Phillips ICC, Ulidowski I (1996) Ordered SOS rules and weak bisimulation. Theory Formal Methods
Roscoe AW, Gardiner PHB, Goldsmith MH, Hulance JR, Jackson DM, Scattergood JB (1995) Hierarchical compression for model-checking CSP, or how to check 1020 dining philosophers for deadlock. In: Proceedings of TACAS 1995. BRICS
Roscoe AW (1994) Model-checking CSP. A classical mind: essays in honour of CAR Hoare
Roscoe AW (1998) The theory and practice of concurrency
Roscoe AW (2010) Understanding concurrent systems. Springer, Berlin
Sangiorgi D (1996) A theory of bisimulation for the π-calculus. Acta Informatica 33(1): 69–97
Tarjan RE (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2): 146–160
Tarjan RE (1976) Edge-disjoint spanning trees and depth-first search. Acta Informatica 6(2): 171–185
van Glabbeek RJ, Weijland WP (1996) Branching time and abstraction in bisimulation semantics. J ACM 43(3): 555–600
Wimmer R, Herbstritt M, Hermanns H, Strampp K, Becker B (2006) Sigref—a symbolic bisimulation tool box. In: Automated technology for verification and analysis. Springer, pp 477–492
Author information
Authors and Affiliations
Corresponding author
Additional information
Stephan Merz, Jun Pang, and Jin Song Dong
Rights and permissions
About this article
Cite this article
Boulgakov, A., Gibson-Robinson, T. & Roscoe, A.W. Computing maximal weak and other bisimulations. Form Asp Comp 28, 381–407 (2016). https://doi.org/10.1007/s00165-016-0366-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-016-0366-2