All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F17%3A00094905" target="_blank" >RIV/00216224:14330/17:00094905 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-57861-3_10" target="_blank" >http://dx.doi.org/10.1007/978-3-319-57861-3_10</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-57861-3_10" target="_blank" >10.1007/978-3-319-57861-3_10</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation

  • Original language 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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

    <a href="/en/project/GA15-11089S" target="_blank" >GA15-11089S: Parameter Discovery for Biological Models Using Model Checking</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2017

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Petri Nets 2017

  • ISBN

    9783319578606

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    20

  • Pages from-to

    139-158

  • Publisher name

    Springer International Publishing

  • Place of publication

    Holandsko

  • Event location

    Zaragoza, Spain

  • Event date

    Jun 25, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000430740600010