Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation
| Authors | |
|---|---|
| Year of publication | 2017 |
| Type | Article in Proceedings |
| Conference | Petri Nets 2017 |
| MU Faculty or unit | |
| Citation | |
| web | https://doi.org/10.1007/978-3-319-57861-3_10 |
| Doi | http://dx.doi.org/10.1007/978-3-319-57861-3_10 |
| Keywords | CTL model checking; Petri Nets; distributed algorithms; on-the-fly state-space search; parallelism |
| Description | Equivalence and model checking problems can be encoded into computing fixed points on dependency graphs. Dependency graphs represent causal dependencies among the nodes of the graph by means of hyper-edges. We suggest to extend the model of dependency graphs with so-called negation edges in order to increase their applicability. The graphs (as well as the verification problems) suffer from the state space explosion problem. To combat this issue, we design an on-the-fly algorithm for efficiently computing fixed points on extended dependency graphs. Our algorithm supplements previous approaches with the possibility to back-propagate, in certain scenarios, the domain value 0, in addition to the standard back-propagation of the value 1. Finally, we design a distributed version of the algorithm, implement it in an open-source tool, and demonstrate the efficiency of our general approach on the benchmark of Petri net models and CTL queries from the Model Checking Contest 2016. |
| Related projects: |