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”

Formal Analysis of Qualitative Long-Term Behaviour in Parametrised Boolean Networks.

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00108117" target="_blank" >RIV/00216224:14330/19:00108117 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-030-32409-4_22" target="_blank" >http://dx.doi.org/10.1007/978-3-030-32409-4_22</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-32409-4_22" target="_blank" >10.1007/978-3-030-32409-4_22</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Formal Analysis of Qualitative Long-Term Behaviour in Parametrised Boolean Networks.

  • Original language description

    Boolean networks offer an elegant way to model the behaviour of complex systems with positive and negative feedback. The long-term behaviour of a Boolean network is characterised by its attractors. Depending on various logical parameters, a Boolean network can exhibit vastly different types of behaviour. Hence, the structure and quality of attractors can undergo a significant change known in systems theory as attractor bifurcation. In this paper, we establish formally the notion of attractor bifurcation for Boolean networks. We propose a semi-symbolic approach to attractor bifurcation analysis based on a parallel algorithm. We use machine-learning techniques to construct a compact, human-readable, representation of the bifurcation analysis results. We demonstrate the method on a set of highly parametrised Boolean networks.

  • 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/GA18-00178S" target="_blank" >GA18-00178S: Discrete Bifurcation Analysis of Reactive Systems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2019

  • 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

    Formal Methods and Software Engineering - 21st International Conference on Formal Engineering Methods, ICFEM 2019, Shenzhen, China, November 5-9, 2019, Proceedings

  • ISBN

    9783030324087

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    17

  • Pages from-to

    353-369

  • Publisher name

    Springer

  • Place of publication

    Heidelberg

  • Event location

    Shenzen

  • Event date

    Jan 1, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article