A Distributed Fixed-Point Algorithm for Extended Dependency Graphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F18%3A00105266" target="_blank" >RIV/00216224:14330/18:00105266 - isvavai.cz</a>

Výsledek na webu

<a href="https://content.iospress.com/articles/fundamenta-informaticae/fi1707" target="_blank" >https://content.iospress.com/articles/fundamenta-informaticae/fi1707</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3233/FI-2018-1707" target="_blank" >10.3233/FI-2018-1707</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs

Popis výsledku v původním jazyce

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ázev v anglickém jazyce

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Fundamenta Informaticae

ISSN

0169-2968

e-ISSN

—

Svazek periodika

161

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

PL - Polská republika

Počet stran výsledku

31

Strana od-do

351-381

Kód UT WoS článku

000437739500003

EID výsledku v databázi Scopus

—