Paper Info
Title
Bisimulation minimisations for boolean equation systems
Abstract
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.
Year
DOI
Venue
2009
10.1007/978-3-642-19237-1_12
Haifa Verification Conference
Field
DocType
Volume
Formal equivalence checking,ENCODE,Model checking,Computer science,Quotient,Algorithm,Theoretical computer science,Minimisation (psychology),Boolean algebra,Bisimulation,Encoding (memory)
Conference
6405
ISSN
Citations 
PageRank 
0302-9743
7
0.48
References 
Authors
14
2
Name
Order
Citations
PageRank
J. J. A. Keiren1978.13
Tim A. C. Willemse234532.79