.png){kind=icon}
返回
Bringing memory to Boolean networks: A unifying framework
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcss.2025.103729.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Boolean networks are extensively applied as models of complex dynamical systems, aiming at capturing essential features related to causality and synchronicity of the state changes of components along time. Dynamics of Boolean networks result from the application of their Boolean map according to a so-called update mode, specifying the possible transitions between network configurations. In this paper, we explore update modes that possess a memory on past configurations, and provide a generic framework to define them. We show that recently introduced modes such as the most permissive and interval modes can be naturally expressed in this framework, and we propose novel update modes, the history-based, trapping, and subcube-based modes. Building on the unified definitions, we provide a comprehensive comparison of memory-based update modes, resulting in their hierarchy by simulation and weak simulation. Finally, we highlight consequences of introducing memory on the notions of trajectory and attractors. (c) 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI
Keyword:
Discrete dynamical systems
Trapspaces
Semantics
Concurrency
期刊
J
IF:
0.9
论文数:
56
被引数:
4.5K
机构
引用论文
分享收藏A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks一种基于SAT的同步布尔网络吸引子算法
PREAI
分享收藏
分享收藏分享收藏Reconciling qualitative, abstract, and scalable modeling of biological networks.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏分享收藏
查看更多内容