On-the-Fly branching bisimulation minimization for compositional analysis

Authors:
Yung-Pin Cheng;Hong-Yi Wang;Yu-Ru Cheng
Affiliations:
Software Engineering Lab, Department of Information and Computer Education, National Taiwan Normal University, Taipei, Taiwan;Software Engineering Lab, Department of Information and Computer Education, National Taiwan Normal University, Taipei, Taiwan;Software Engineering Lab, Department of Information and Computer Education, National Taiwan Normal University, Taipei, Taiwan
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 16
Cited 0

CCS expressions finite state processes, and three problems of equivalence

Information and Computation
Design and validation of computer protocols

Design and validation of computer protocols
Compositional reachability analysis using process algebra

TAV4 Proceedings of the symposium on Testing, analysis, and verification
Online minimization of transition systems (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Context constraints for compositional reachability analysis

ACM Transactions on Software Engineering and Methodology (TOSEM)
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Symbolic Model Checking

Symbolic Model Checking
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Refactoring design models for inductive verification

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
State Space Reduction Using Partial tau-Confluence

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Tool Set for deciding Behavioral Equivalences

CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
State Space Reduction by Proving Confluence

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Minimal Model Generation

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Compositional Minimization of Finite State Systems

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Towards scalable compositional analysis by refactoring design models

Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Branching bisimulation minimization is often used to obtain a smaller but equivalent model for a complicated one. It is particularly useful in compositional analysis to replace a subsystem’s behaviors with the minimal one so that the growth of states can be controlled in a hierarchical, divide-and-conquer manner. Nonetheless, branching bisimulation minimization is typically invoked after the whole state space is enumerated entirely. In practice, when the parallel composition engine drains too many memory resources during exploring reachable states, it causes operating systems to swap excessively (i.e., thrashing) due to the page replacement of virtual memory. When such a scenario occurs, the system degrades dramatically in performance and becomes unusable, albeit minimization is possible to abstract the whole state space into very small one. In this paper, we present a pragmatic approach to make branching bisimulation minimization on-the-fly. It minimizes the state space during composition and releases memory resources that are no longer used. Our approach allows larger systems to be verified by taking account of operating systems memory management.