Bisimulation Minimisations for Boolean Equation Systems
Boolean equation systems (BESs) have been used to encode several complex verification problems, including model checking and equivalence checking. We introduce the concepts of strong bisimulation and idempotence-identifying bisimulation for BESs, and we prove that these can be used for minimising BESs prior to solving these. Our results show that large reductions of the BESs may be obtained efficiently. Minimisation is rewarding for BESs with non-trivial alternations: the time required for solving the original BES mostly exceeds the time required for quotienting plus the time for solving the quotient. Furthermore, we provide a verification example that demonstrates that bisimulation minimisation of a process prior to encoding the verification problem on that process as a BES can be arbitrarily less effective than minimising the BES that encodes the verification problem.
KeywordsModel Check Equation System Proposition Variable Label Transition System Proposition Formula
Unable to display preview. Download preview PDF.
- 8.Keiren, J., Willemse, T.A.C.: Bisimulation minimisations for boolean equation systems. Technical Report CSR09-17, Eindhoven University of Technology (2009)Google Scholar
- 9.Mader, A.: Verification of Modal Properties Using Boolean Equation Systems. PhD thesis, Technische Universität München (1997)Google Scholar
- 11.Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6) (1987)Google Scholar
- 12.Reniers, M.A., Willemse, T.A.C.: Analysis of Boolean equation systems through structure graphs. In: Proc. of SOS 2009. EPTCS (2009) (to appear)Google Scholar
- 13.Blom, S., Orzan, S.: Distributed state space minimization. Int. J. STTT 7(3) (2005)Google Scholar