Using Assumptions to Distribute Alternation Free mu-Calculus Model Checking

Warning

This publication doesn't include Faculty of Education. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors	BRIM Luboš ŽÍDKOVÁ Jitka
Year of publication	2003
Type	Article in Proceedings
Conference	2st International Workshop on Parallel and Distributed Model Checking (PDMC 2003)
MU Faculty or unit	Faculty of Informatics
Citation
Web	http://www.elsevier.nl/locate/entcs
Field	Informatics
Keywords	verification; model checking
Description	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.
Related projects:	Automated Verification of Parallel and Distributed Systems Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing