Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking

Details Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking

2010-06-08

arxiv.org/abs/1006.1416v1

EPTCS 25, 2010, pp. 173-187

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.25.17

One technique to reduce the state-space explosion problem in temporal logic model checking is symmetry reduction. The combination of symmetry reduction and symbolic model checking by using BDDs suffered a long time from the prohibitively large BDD for the orbit relation. Dynamic symmetry reduction calculates representatives of equivalence classes of states dynamically and thus avoids the construction of the orbit relation. In this paper, we present a new efficient model checking algorithm based on dynamic symmetry reduction. Our experiments show that the algorithm is very fast and allows the verification of larger systems. We additionally implemented the use of state symmetries for symbolic symmetry reduction. To our knowledge we are the first who investigated state symmetries in combination with BDD based symbolic model checking.

Affiliated with

Also associated with

No associations

Rating

Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29357