Identification of all steady states in large networks by logical analysis
From MaRDI portal
Publication:253470
DOI10.1016/S0092-8240(03)00061-2zbMath1334.92155WikidataQ51637962 ScholiaQ51637962MaRDI QIDQ253470
Martine Labbé, Vincent Devloo, Pierre Hansen
Publication date: 8 March 2016
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Related Items (8)
On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity ⋮ Stable states of Boolean regulatory networks composed over hexagonal grids ⋮ Piecewise-linear models of genetic regulatory networks: equilibria and their stability ⋮ Application of formal methods to biological regulatory networks: extending Thomas' asynchronous logical approach with temporal logic ⋮ Boolean dynamics revisited through feedback interconnections ⋮ Logical reduction of biological networks to their most determinative components ⋮ Algorithms for Inference, Analysis and Control of Boolean Networks ⋮ Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
This page was built for publication: Identification of all steady states in large networks by logical analysis
