Published In

Discrete & Continuous Dynamical Systems - Series B

Document Type

Post-Print

Publication Date

12-2016

Subjects

System theory, Computational complexity, Boolean algebra, Commutative algebra

Abstract

For a Boolean network we consider asynchronous updates and define the exclusive asynchronous basin of attraction for any steady state or cyclic attractor. An algorithm based on commutative algebra is presented to compute the exclusive basin. Finally its use for targeting desirable attractors by selective intervention on network nodes is illustrated with two examples, one cell signalling network and one sensor network measuring human mobility.

Description

This is a pre-copy-editing, author-produced PDF of an article accepted for publication following peer review. The definitive publisher-authenticated version is available online at: http://dx.doi.org/10.3934/dcdsb.2016103.

DOI

10.3934/dcdsb.2016103

Persistent Identifier

http://archives.pdx.edu/ds/psu/19025

Share

COinS