## Abstract

The state explosion problem is the main limitation of model checking. Symmetries in the system being verified can be exploited in order to avoid this problem by defining an equivalence (symmetry) relation on the states of the system, which induces a semantically equivalent quotient system of smaller size. On the other hand, heuristic search algorithms can be applied to improve the bug finding capabilities of model checking. Such algorithms use

heuristic functions to guide the exploration. Bestfirst

is used for accelerating the search, while A* guarantees optimal error trails if combined with admissible estimates. We analyze some aspects of combining both approaches, concentrating on the problem of finding the optimal path to the equivalence class of a given error state. Experimental

results evaluate our approach.

heuristic functions to guide the exploration. Bestfirst

is used for accelerating the search, while A* guarantees optimal error trails if combined with admissible estimates. We analyze some aspects of combining both approaches, concentrating on the problem of finding the optimal path to the equivalence class of a given error state. Experimental

results evaluate our approach.

Original language | English |
---|---|

Title of host publication | Proceedings of the 2nd Workshop on Model Checking and Artificial Intelligence |

Publisher | AAAI Press |

Publication date | 2003 |

Publication status | Published - 2003 |

Externally published | Yes |

Event | 2nd Workshop on Model Checking and Artificial Intelligence - Acapulco, Mexico Duration: 10 Aug 2003 → … Conference number: 2 |

### Conference

Conference | 2nd Workshop on Model Checking and Artificial Intelligence |
---|---|

Number | 2 |

Country | Mexico |

City | Acapulco |

Period | 10/08/2003 → … |