Extended Dependency Graphs and Efficient Distributed
Fixed-Point Computation

D 2017

Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation

DALSGAARD, Andreas E., Søren ENEVOLDSEN, Peter FOGH, Lasse S. JENSEN, Tobias S. JEPSEN et. al.

Basic information

Original name

Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation

Authors

DALSGAARD, Andreas E. (208 Denmark), Søren ENEVOLDSEN (208 Denmark), Peter FOGH (208 Denmark), Lasse S. JENSEN (208 Denmark), Tobias S. JEPSEN (208 Denmark), Isabella KAUFMANN (208 Denmark), Kim G. LARSEN (208 Denmark), Søren M. NIELSEN (208 Denmark), Mads Chr. OLESEN (208 Denmark), Samuel PASTVA (703 Slovakia, belonging to the institution) and Jiří SRBA (203 Czech Republic, guarantor, belonging to the institution)

Edition

Holandsko, Petri Nets 2017, p. 139-158, 20 pp. 2017

Publisher

Springer International Publishing

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10200 1.2 Computer and information sciences

Country of publisher

Netherlands

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

References:

URL

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/17:00094905

Organization unit

Faculty of Informatics

ISBN

978-3-319-57860-6

ISSN

DOI

http://dx.doi.org/10.1007/978-3-319-57861-3_10

UT WoS

000430740600010

Keywords in English

CTL model checking; Petri Nets; distributed algorithms; on-the-fly state-space search; parallelism

Abstract

V originále

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.

Links

GA15-11089S, research and development project

Name: Získávání parametrů biologických modelů pomocí techniky ověřování modelů

Investor: Czech Science Foundation

Citovat

DALSGAARD, Andreas E., Søren ENEVOLDSEN, Peter FOGH, Lasse S. JENSEN, Tobias S. JEPSEN, Isabella KAUFMANN, Kim G. LARSEN, Søren M. NIELSEN, Mads Chr. OLESEN, Samuel PASTVA and Jiří SRBA. Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation. In van der Aalst, Wil and Best, Eike. Petri Nets 2017. Holandsko: Springer International Publishing, 2017, p. 139-158. ISBN 978-3-319-57860-6. Available from: https://dx.doi.org/10.1007/978-3-319-57861-3_10.

@inproceedings{1388222,
   author = {Dalsgaard, Andreas E. and Enevoldsen, Søren and Fogh, Peter and Jensen, Lasse S. and Jepsen, Tobias S. and Kaufmann, Isabella and Larsen, Kim G. and Nielsen, Søren M. and Olesen, Mads Chr. and Pastva, Samuel and Srba, Jiří},
   address = {Holandsko},
   booktitle = {Petri Nets 2017},
   doi = {http://dx.doi.org/10.1007/978-3-319-57861-3_10},
   editor = {van der Aalst, Wil and Best, Eike},
   keywords = {CTL model checking; Petri Nets; distributed algorithms; on-the-fly state-space search; parallelism},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Holandsko},
   isbn = {978-3-319-57860-6},
   pages = {139-158},
   publisher = {Springer International Publishing},
   title = {Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation},
   url = {https://doi.org/10.1007/978-3-319-57861-3_10},
   year = {2017}
}

TY  - JOUR
ID  - 1388222
AU  - Dalsgaard, Andreas E. - Enevoldsen, Søren - Fogh, Peter - Jensen, Lasse S. - Jepsen, Tobias S. - Kaufmann, Isabella - Larsen, Kim G. - Nielsen, Søren M. - Olesen, Mads Chr. - Pastva, Samuel - Srba, Jiří
PY  - 2017
TI  - Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation
PB  - Springer International Publishing
CY  - Holandsko
SN  - 9783319578606
KW  - CTL model checking
KW  - Petri Nets
KW  - distributed algorithms
KW  - on-the-fly state-space search
KW  - parallelism
UR  - https://doi.org/10.1007/978-3-319-57861-3_10
N2  - 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.
ER  -

DALSGAARD, Andreas E., Søren ENEVOLDSEN, Peter FOGH, Lasse S. JENSEN, Tobias S. JEPSEN, Isabella KAUFMANN, Kim G. LARSEN, Søren M. NIELSEN, Mads Chr. OLESEN, Samuel PASTVA and Jiří SRBA. Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation. In van der Aalst, Wil and Best, Eike. \textit{Petri Nets 2017}. Holandsko: Springer International Publishing, 2017, p.~139-158. ISBN~978-3-319-57860-6. Available from: https://dx.doi.org/10.1007/978-3-319-57861-3\_{}10.

Detailed Information on Publication Record