Abstract. Reduction and abstraction techniques have been proposed to address the state space explosion problem in verification. In this paper, we present reduction and abstraction techniques for component-based systems modeled in BIP (Behavior, Interaction and Priority). Given a BIP system consisting of several atomic components, we select two atomic components amenable for reduction and compute their product. The resulting product component typically contains constants and branching bisimilar states. We use constant propagation to reduce the resulting component. Then we use a branching bisimulation abstraction to compute an abstraction of the product component. The presented method is fully implemented. Our results show a drastic improvement in verifying BIP systems.
The work in REF uses bisimulation-based abstraction to reduce the state space and then uses NuSMV for modelchecking.
Reduction and Abstraction Techniques for BIP
FACS
Computer Science