Concurrency in Boolean networks
From MaRDI portal
Publication:6151158
DOI10.1007/s11047-019-09748-4zbMath1530.68190arXiv1905.13467WikidataQ127717475 ScholiaQ127717475MaRDI QIDQ6151158
Stefan Haar, Thomas Chatain, Loïc Paulevé, Juraj Kolčák, Aalok Thakkar
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.13467
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Symbolic dynamics (37B10) Systems biology, networks (92C42)
Related Items (5)
Computing bottom SCCs symbolically using transition guided reduction ⋮ Petri nets semantics of reaction rules (RR). A language for ecosystems modelling ⋮ Unnamed Item ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient unfolding of contextual Petri nets
- A concurrency-preserving translation from time Petri nets to networks of timed automata
- Petri net representation of multi-valued logical regulatory graphs
- Complexity results for 1-safe nets
- Fairness and partial order semantics
- Structure of concurrency
- Maximum number of fixed points in regulatory Boolean networks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Negative circuits and sustained oscillations in asynchronous automata networks
- Concurrent and maximally concurrent evolution of nonsequential systems
- Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
- Fundamentals of modelling concurrency using discrete relational structures
- Partial order semantics and read arcs
- Boolean network-based analysis of the apoptosis network: irreversible apoptosis and stable surviving
- Boolean networks: beyond generalized asynchronicity
- Contextual Petri nets, asymmetric event structures, and processes
- Effect of asynchronous updating on the stability of cellular automata
- Unfoldings: A partial-order approach to model checking.
- Non-atomic Transition Firing in Contextual Nets
- Non sequential semantics for contextual P/T nets
- Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks
- Applications and Theory of Petri Nets 2004
- Synchronism versus asynchronism in monotonic Boolean automata networks
This page was built for publication: Concurrency in Boolean networks
