 |
|
van de Pol, J.C. and Weber, Michael
(2008)
A Multi-Core Solver for Parity Games.
In: Proceedings of the 7th International Workshop on Parallel and Distributed Methods in verifiCation, 29 Mar 2008, Budapest, Hungary.
.
Electronic Notes in Theoretical Computer Science 220 (2).
Elsevier.
ISSN 1571-0661
Full text available as: Official URL: http://dx.doi.org/10.1016/j.entcs.2008.11.011  AbstractWe describe a parallel algorithm for solving parity games,
with applications in, e.g., modal mu-calculus model
checking with arbitrary alternations, and (branching) bisimulation
checking. The algorithm is based on Jurdzinski's Small Progress
Measures. Actually, this is a class of algorithms, depending on
a selection heuristics.
Our algorithm operates lock-free, and mostly wait-free (except for
infrequent termination detection), and thus allows maximum
parallelism. Additionally, we conserve memory by avoiding storage
of predecessor edges for the parity graph through strictly
forward-looking heuristics.
We evaluate our multi-core implementation's behaviour on parity games
obtained from mu-calculus model checking problems for a set of
communication protocols, randomly generated problem instances, and
parametric problem instances from the literature.
| Item Type: | Conference or Workshop Paper (Full Paper, Talk) |
|---|
| Research Group: | EWI-FMT: Formal Methods and Tools |
|---|
| Research Program: | CTIT-DSN: Dependable Systems and Networks |
|---|
| Research Project: | veriGEM: A Verification Grid for Enhanced Model Checking |
|---|
| ID Code: | 12953 |
|---|
| Status: | Published |
|---|
| Deposited On: | 17 December 2008 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item
|
|
|
Nederlands
Contact
Sitemap
Search
Organisation