Finding attractors in asynchronous boolean dynamics

Thomas Skodawessely, Konstantin Klemm

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


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
Issue number3
Publication statusPublished - Jun 2011


  • Boolean network
  • algorithm
  • attractors

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Finding attractors in asynchronous boolean dynamics'. Together they form a unique fingerprint.

Cite this