TY - GEN
T1 - Distributed computation of fixed points on dependency graphs
AU - Dalsgaard, Andreas Engelbredt
AU - Enevoldsen, Søren
AU - Larsen, Kim Guldstrand
AU - Srba, Jiri
PY - 2016/11
Y1 - 2016/11
N2 - Dependency graph is an abstract mathematical structure for representing complex causal dependencies among its vertices. Several equivalence and model checking questions, boolean equation systems and other problems can be reduced to fixed-point computations on dependency graphs. We develop a novel distributed algorithm for computing such fixed points, prove its correctness and provide an efficient, open-source implementation of the algorithm. The algorithm works in an on-the-fly manner, eliminating the need to generate a priori the entire dependency graph. We evaluate the applicability of our approach by a number of experiments that verify weak simulation/bisimulation equivalences between CCS processes and we compare the performance with the well-known CWB tool. Even though the fixed-point computation, being a P-complete problem, is difficult to parallelize in theory, we achieve significant speed-ups in the performance as demonstrated on a Linux cluster with several hundreds of cores.
AB - Dependency graph is an abstract mathematical structure for representing complex causal dependencies among its vertices. Several equivalence and model checking questions, boolean equation systems and other problems can be reduced to fixed-point computations on dependency graphs. We develop a novel distributed algorithm for computing such fixed points, prove its correctness and provide an efficient, open-source implementation of the algorithm. The algorithm works in an on-the-fly manner, eliminating the need to generate a priori the entire dependency graph. We evaluate the applicability of our approach by a number of experiments that verify weak simulation/bisimulation equivalences between CCS processes and we compare the performance with the well-known CWB tool. Even though the fixed-point computation, being a P-complete problem, is difficult to parallelize in theory, we achieve significant speed-ups in the performance as demonstrated on a Linux cluster with several hundreds of cores.
U2 - 10.1007/978-3-319-47677-3_13
DO - 10.1007/978-3-319-47677-3_13
M3 - Article in proceeding
AN - SCOPUS:84994495849
SN - 978-3-319-47676-6
T3 - Lecture Notes in Computer Science
SP - 197
EP - 212
BT - Dependable Software Engineering
PB - Springer
T2 - 2nd International Symposium on Dependable Software Engineering: Theories, Tools and Applications, SETTA 2016
Y2 - 9 November 2016 through 11 November 2016
ER -