Heuristics for Hierarchical Partitioning with Application to Model Checking

DMCA

Heuristics for Hierarchical Partitioning with Application to Model Checking (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by M. Oliver Möller , Rajeev Alur

Venue:	Department of Computer Science, University of Aarhus
Citations:	2 - 0 self

BibTeX

@INPROCEEDINGS{Möller00heuristicsfor,
    author = {M. Oliver Möller and Rajeev Alur},
    title = {Heuristics for Hierarchical Partitioning with Application to Model Checking},
    booktitle = {Department of Computer Science, University of Aarhus},
    year = {2000},
    pages = {71--85}
}

OpenURL

Abstract

. Given a collection of connected components, it is often desired to cluster together parts of strong correspondence, yielding a hierarchical structure. We address the automation of this process and apply heuristics to battle the combinatorial and computational complexity. We define a cost function that captures the quality of a structure relative to the connections and favors shallow structures with a low degree of branching. Finding a structure with minimal cost is NP -complete. We present a greedy polynomial-time algorithm that approximates good solutions incrementally by local evaluation of a heuristic function. We argue for a heuristic function based on four criteria: the number of enclosed connections, the number of components, the number of touched connections and the depth of the structure. We report on an application in the context of formal verification, where our algorithm serves as a preprocessor for a temporal scaling technique, called "Next" heuristic [2]. The latter is applicable in reachability analysis and is included in a recent version of the Mocha model checking tool. We demonstrate performance and benefits of our method and use an asynchronous parity computer and an opinion poll protocol as case studies. 1

Keyphrases

model checking heuristic function enclosed connection touched connection local evaluation connected component mocha model formal verification asynchronous parity computer case study favor shallow structure minimal cost structure relative low degree opinion poll protocol temporal scaling technique recent version computational complexity good solution hierarchical structure reachability analysis next heuristic cost function strong correspondence greedy polynomial-time algorithm

DMCA