Fixing monotone Boolean networks asynchronously

11 Dec 2019 Aracena Julio Gadouleau Maximilien Richard Adrien Salinas Lilian

The asynchronous automaton associated with a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$ is considered in many applications. It is the finite deterministic automaton with set of states $\{0,1\}^n$, alphabet $\{1,\dots,n\}$, where the action of letter $i$ on a state $x$ consists in either switching the $i$th component if $f_i(x)\neq x_i$ or doing nothing otherwise... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • DISCRETE MATHEMATICS