A Distributed Fixed-Point Algorithm for Extended Dependency
Graphs

J 2018

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs

DALSGAARD, Andreas E.; Søren ENEVOLDSEN; Peter FOGH; Lasse S. JENSEN; Peter G. JENSEN et al.

Základní údaje

Originální název

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs

Autoři

Vydání

Fundamenta Informaticae, 2018, 0169-2968

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Polsko

Utajení

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

Odkazy

URL, URL

Impakt faktor

Impact factor: 1.204

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14330/18:00105266

Organizační jednotka

Fakulta informatiky

Klíčová slova anglicky

extended dependency graph; fixed-point algorithm; petri nets

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 29. 4. 2019 17:28, RNDr. Pavel Šmerk, Ph.D.

Anotace

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 verifi- cation 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 our open-source tool TAPAAL, and demonstrate the efficiency of our general approach on the benchmark of Petri net models and CTL queries from the annual Model Checking Contest.

Návaznosti

MUNI/A/0854/2017, interní kód MU

Název: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace VII.

Investor: Masarykova univerzita, Rozsáhlé výpočetní systémy: modely, aplikace a verifikace VII., DO R. 2020_Kategorie A - Specifický výzkum - Studentské výzkumné projekty

Citovat

DALSGAARD, Andreas E.; Søren ENEVOLDSEN; Peter FOGH; Lasse S. JENSEN; Peter G. JENSEN; Tobias S. JEPSEN; Isabella KAUFMANN; Kim G. LARSEN; Søren M. NIELSEN; Mads Chr. OLESEN; Samuel PASTVA a Jiří SRBA. A Distributed Fixed-Point Algorithm for Extended Dependency Graphs. Fundamenta Informaticae. 2018, roč. 161, č. 4, s. 351-381. ISSN 0169-2968. Dostupné z: https://doi.org/10.3233/FI-2018-1707.

@article{1483742,
   author = {Dalsgaard, Andreas E. and Enevoldsen, Søren and Fogh, Peter and Jensen, Lasse S. and Jensen, Peter G. 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ří},
   article_number = {4},
   doi = {https://doi.org/10.3233/FI-2018-1707},
   keywords = {extended dependency graph; fixed-point algorithm; petri nets},
   language = {eng},
   issn = {0169-2968},
   journal = {Fundamenta Informaticae},
   title = {A Distributed Fixed-Point Algorithm for Extended Dependency Graphs},
   url = {https://content.iospress.com/articles/fundamenta-informaticae/fi1707},
   volume = {161},
   year = {2018}
}

TY  - JOUR
ID  - 1483742
AU  - Dalsgaard, Andreas E. - Enevoldsen, Søren - Fogh, Peter - Jensen, Lasse S. - Jensen, Peter G. - Jepsen, Tobias S. - Kaufmann, Isabella - Larsen, Kim G. - Nielsen, Søren M. - Olesen, Mads Chr. - Pastva, Samuel - Srba, Jiří
PY  - 2018
TI  - A Distributed Fixed-Point Algorithm for Extended Dependency Graphs
JF  - Fundamenta Informaticae
VL  - 161
IS  - 4
SP  - 351-381
EP  - 351-381
SN  - 01692968
KW  - extended dependency graph
KW  - fixed-point algorithm
KW  - petri nets
UR  - https://content.iospress.com/articles/fundamenta-informaticae/fi1707
L2  - https://content.iospress.com/articles/fundamenta-informaticae/fi1707
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 verifi- cation 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 our open-source tool TAPAAL, and demonstrate the efficiency of our general approach on the benchmark of Petri net models and CTL queries from the annual Model Checking Contest.
ER  -

DALSGAARD, Andreas E.; Søren ENEVOLDSEN; Peter FOGH; Lasse S. JENSEN; Peter G. JENSEN; Tobias S. JEPSEN; Isabella KAUFMANN; Kim G. LARSEN; Søren M. NIELSEN; Mads Chr. OLESEN; Samuel PASTVA a Jiří SRBA. A Distributed Fixed-Point Algorithm for Extended Dependency Graphs. \textit{Fundamenta Informaticae}. 2018, roč.~161, č.~4, s.~351-381. ISSN~0169-2968. Dostupné z: https://doi.org/10.3233/FI-2018-1707.

Přehled o publikaci