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”

Distributed Computation of Fixed Points on Dependency Graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00094045" target="_blank" >RIV/00216224:14330/16:00094045 - isvavai.cz</a>

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007/978-3-319-47677-3_13" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-319-47677-3_13</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Distributed Computation of Fixed Points on Dependency Graphs

  • Original language description

    Dependency graph is an abstract mathematical structure for representing complex causal dependencies among its vertices. Several equivalence and model checking questions, boolean equation systems and other problems can be reduced to fixed-point computations on dependency graphs. We develop a novel distributed algorithm for computing such fixed points, prove its correctness and provide an efficient, open-source implementation of the algorithm. The algorithm works in an on-the-fly manner, eliminating the need to generate a priori the entire dependency graph. We evaluate the applicability of our approach by a number of experiments that verify weak simulation/bisimulation equivalences between CCS processes and we compare the performance with the well-known CWB tool. Even though the fixed-point computation, being a P-complete problem, is difficult to parallelize in theory, we achieve significant speed-ups in the performance as demonstrated on a Linux cluster with several hundreds of cores.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • 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

    Proceedings of Symposium on Dependable Software Engineering: Theories, Tools and Applications (SETTA'16)

  • ISBN

    9783319476766

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    16

  • Pages from-to

    197-212

  • Publisher name

    Springer

  • Place of publication

    Netherlands

  • Event location

    China

  • Event date

    Jan 1, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000389932000013