Concurrency in Boolean networks
From MaRDI portal
Abstract: Boolean networks (BNs) are widely used to model the qualitative dynamics of biological systems. Besides the logical rules determining the evolution of each component with respect to the state of its regulators, the scheduling of component updates can have a dramatic impact on the predicted behaviours. In this paper, we explore the use of Read (contextual) Petri Nets (RPNs) to study dynamics of BNs from a concurrency theory perspective. After showing bi-directional translations between RPNs and BNs and analogies between results on synchronism sensitivity, we illustrate that usual updating modes for BNs can miss plausible behaviours, i.e., incorrectly conclude on the absence/impossibility of reaching specific configurations. We propose an encoding of BNs capitalizing on the RPN semantics enabling more behaviour than the generalized asynchronous updating mode. The proposed encoding ensures a correct abstraction of any multivalued refinement, as one may expect to achieve when modelling biological systems with no assumption on its time features.
Recommendations
Cites work
- A concurrency-preserving translation from time Petri nets to networks of timed automata
- Applications and Theory of Petri Nets 2004
- Boolean network-based analysis of the apoptosis network: irreversible apoptosis and stable surviving
- Boolean networks: beyond generalized asynchronicity
- Complexity results for 1-safe nets
- Concurrent and maximally concurrent evolution of nonsequential systems
- Contextual Petri nets, asymmetric event structures, and processes
- Cunf: a tool for unfolding and verifying Petri nets with read arcs
- Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
- Effect of asynchronous updating on the stability of cellular automata
- Efficient unfolding of contextual Petri nets
- Fairness and partial order semantics
- Fundamentals of modelling concurrency using discrete relational structures
- Goal-driven unfolding of Petri nets
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- scientific article; zbMATH DE number 1337730 (Why is no real title available?)
- Maximum number of fixed points in regulatory Boolean networks
- Negative circuits and sustained oscillations in asynchronous automata networks
- Non sequential semantics for contextual P/T nets
- Non-atomic transition firing in contextual nets
- Number of fixed points and disjoint cycles in monotone Boolean networks
- Partial order semantics and read arcs
- Petri net representation of multi-valued logical regulatory graphs
- Structure of concurrency
- Synchronism versus asynchronism in monotonic Boolean automata networks
- Time Petri nets for modelling and analysis of biochemical networks
- Unfoldings: A partial-order approach to model checking.
Cited in
(10)- Learning any memory-less discrete semantics for dynamical systems represented by logic programs
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
- Petri nets semantics of reaction rules (RR). A language for ecosystems modelling
- About block-parallel Boolean networks: a position paper
- Avoid one's doom: finding cliff-edge configurations in Petri nets
- Non-deterministic updates of Boolean networks
- A semantics for Boolean networks consistent with regulatory threshold constraints
- Searching for attractors: to infinity and beyond
- Continuous Petri nets faithfully fluidify most permissive Boolean networks
- Computing bottom SCCs symbolically using transition guided reduction
This page was built for publication: Concurrency in Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151158)
