Using Assumptions to Distribute Alternation Free mu-Calculus Model Checking

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F03%3A00009026" target="_blank" >RIV/00216224:14330/03:00009026 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/03:00008592
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Using Assumptions to Distribute Alternation Free mu-Calculus Model Checking
Original language 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA201%2F03%2F0509" target="_blank" >GA201/03/0509: Automated Verification of Parallel and Distributed Systems</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
2st International Workshop on Parallel and Distributed Model Checking (PDMC 2003)
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
16
Pages from-to
19-34
Publisher name
Elsevier
Place of publication
Brno, Czech Republic
Event location
Boulder, Colorado, USA
Event date
Jan 1, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)