Using Assumptions to Distribute Alternation Free mu-Calculus Model Checking
| Autoři | |
|---|---|
| Rok publikování | 2003 |
| Druh | Článek ve sborníku |
| Konference | 2st International Workshop on Parallel and Distributed Model Checking (PDMC 2003) |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | http://www.elsevier.nl/locate/entcs |
| Obor | Informatika |
| Klíčová slova | verification; model checking |
| Popis | In this work we extend the approach used in [Brim,Crhova,Yorav] to perform distributed AFMC model checking. The part of a system held in one computer is modeled as a Kripke structure with border states. Moreover, we use assumptions about the truth of a formula in each state. Each process then repeatedly execute a slight modification of a standard sequential algorithm and exchange its results with other processes. In the paper we define the AFMC semantics that cope with border states and assumptions, present the distributed algorithm and show the main ideas of the proof of its correctness. Complexity and experimental results are provided as well. |
| Související projekty: |