SAF: SAT-based attractor finder in asynchronous automata networks

DOI10.1007/978-3-031-42697-1_12MaRDI QIDQ6199825zbMATH OpenFDO

Authors Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura

Publication date 28 February 2024

Published in Computational Methods in Systems Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-42697-1_12

zbMATH Keywords

attractorautomata networksBoolean networksSAT solvers

Mathematics Subject Classification ID

Systems biology, networks (92C42)

Recommendations

• Finding attractors in asynchronous Boolean dynamics
• An ASP-based approach for attractor enumeration in synchronous and asynchronous Boolean networks
• Attractor identification in asynchronous Boolean dynamics with network reduction
• P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks
• Singleton and 2-periodic attractors of sign-definite Boolean networks

Cites work

• Goal-oriented reduction of automata networks
• Handbook of satisfiability. In 2 parts
• Implementing efficient All solutions SAT solvers
• Sufficient conditions for reachability in automata networks with priorities

This page was built for publication: SAF: SAT-based attractor finder in asynchronous automata networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199825)