Finding attractors in asynchronous boolean dynamics

Thomas Skodawessely, Konstantin Klemm

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

We present a computational method for finding attractors (ergodic sets of states) of Boolean networks under asynchronous update. The approach is based on a systematic removal of state transitions to render the state transition graph acyclic. In this reduced state transition graph, all attractors are fixed points that can be enumerated with little effort in most instances. This attractor set is then extended to the attractor set of the original dynamics. Our numerical tests on standard Kauffman networks indicate that the method is efficient in the sense that the total number of state vectors visited grows moderately with the number of states contained in attractors.

Original languageEnglish
Pages (from-to)439-449
Number of pages11
JournalAdvances in Complex Systems
Volume14
Issue number3
DOIs
Publication statusPublished - Jun 2011
Externally publishedYes

Fingerprint

Computational methods

Keywords

  • algorithm
  • attractors
  • Boolean network

ASJC Scopus subject areas

  • Control and Systems Engineering
  • General

Cite this

Finding attractors in asynchronous boolean dynamics. / Skodawessely, Thomas; Klemm, Konstantin.

In: Advances in Complex Systems, Vol. 14, No. 3, 06.2011, p. 439-449.

Research output: Contribution to journalArticle

Skodawessely, Thomas ; Klemm, Konstantin. / Finding attractors in asynchronous boolean dynamics. In: Advances in Complex Systems. 2011 ; Vol. 14, No. 3. pp. 439-449.
@article{cb38a975d1894db7a266e3bddbc6a851,
title = "Finding attractors in asynchronous boolean dynamics",
abstract = "We present a computational method for finding attractors (ergodic sets of states) of Boolean networks under asynchronous update. The approach is based on a systematic removal of state transitions to render the state transition graph acyclic. In this reduced state transition graph, all attractors are fixed points that can be enumerated with little effort in most instances. This attractor set is then extended to the attractor set of the original dynamics. Our numerical tests on standard Kauffman networks indicate that the method is efficient in the sense that the total number of state vectors visited grows moderately with the number of states contained in attractors.",
keywords = "algorithm, attractors, Boolean network",
author = "Thomas Skodawessely and Konstantin Klemm",
year = "2011",
month = "6",
doi = "10.1142/S0219525911003098",
language = "English",
volume = "14",
pages = "439--449",
journal = "Advances in Complex Systems",
issn = "0219-5259",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "3",

}

TY - JOUR

T1 - Finding attractors in asynchronous boolean dynamics

AU - Skodawessely, Thomas

AU - Klemm, Konstantin

PY - 2011/6

Y1 - 2011/6

N2 - We present a computational method for finding attractors (ergodic sets of states) of Boolean networks under asynchronous update. The approach is based on a systematic removal of state transitions to render the state transition graph acyclic. In this reduced state transition graph, all attractors are fixed points that can be enumerated with little effort in most instances. This attractor set is then extended to the attractor set of the original dynamics. Our numerical tests on standard Kauffman networks indicate that the method is efficient in the sense that the total number of state vectors visited grows moderately with the number of states contained in attractors.

AB - We present a computational method for finding attractors (ergodic sets of states) of Boolean networks under asynchronous update. The approach is based on a systematic removal of state transitions to render the state transition graph acyclic. In this reduced state transition graph, all attractors are fixed points that can be enumerated with little effort in most instances. This attractor set is then extended to the attractor set of the original dynamics. Our numerical tests on standard Kauffman networks indicate that the method is efficient in the sense that the total number of state vectors visited grows moderately with the number of states contained in attractors.

KW - algorithm

KW - attractors

KW - Boolean network

UR - http://www.scopus.com/inward/record.url?scp=79959799569&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959799569&partnerID=8YFLogxK

U2 - 10.1142/S0219525911003098

DO - 10.1142/S0219525911003098

M3 - Article

VL - 14

SP - 439

EP - 449

JO - Advances in Complex Systems

JF - Advances in Complex Systems

SN - 0219-5259

IS - 3

ER -