|
Barnat, J. and Chaloupka, J. and van de Pol, J.C.
(2008)
Improved Distributed Algorithms for SCC Decomposition.
In: Proceedings of the 6th International Workshop on Parallel and Distributed Methods in verifiCation, 8 Jul 2007, Berlin.
.
Electronic Notes in Theoretical Computer Science 198 (1).
Elsevier.
ISSN 1571-0661
Full text available as: Official URL: http://dx.doi.org/10.1016/j.entcs.2008.02.001  AbstractWe study and improve the OBF technique, which was used in distributed algorithms for the decomposi-
tion of a partitioned graph into its strongly connected components. In particular, we introduce a recursive
variant of OBF and experimentally evaluate several different implementations of it that vary in the degree
of parallelism. For the evaluation we used synthetic graphs with a few large components and graphs with
many small components. We also experimented with graphs that arise as state spaces in real model check-
ing applications. The experimental results are compared with that of other successful SCC decomposition
techniques. | 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, EC-MOAN: Scalable Modelling and Analysis Techniques to study Emergent Cell Behaviour – understanding the E. coli stress response |
|---|
| ID Code: | 12287 |
|---|
| Status: | Published |
|---|
| Deposited On: | 24 April 2008 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item
|
Nederlands
Contact
Sitemap
Search
Organisation
