Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking.
| Authors | |
|---|---|
| Year of publication | 2004 |
| Type | Article in Proceedings |
| Conference | Formal Methods in Computer-Aided Design (FMCAD) |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | distributed - memory LTL model checking; graph predecessors |
| Description | We present a new distributed-memory algorithm for enumerative LTL model-checking that is designed to be run on a cluster of workstations communicating via MPI. The detection of accepting cycles is based on computing maximal accepting predecessors and the subsequent decomposition of the graph into independent predecessor subgraphs induced by maximal accepting predecessors. Several optimizations of the basic algorithm are presented and the influence of the ordering on the algorithm performance is discussed. Experimental implementation of the algorithm shows promising results. |
| Related projects: |