|
Complexity of the dynamics of resource-bounded reaction systems| title | Complexity of the dynamics of resource-bounded reaction systems |
|---|
| start_date | 2024/07/16 |
|---|
| schedule | 16h |
|---|
| online | no |
|---|
| location_info | TPR2 04.05 & Online |
|---|
| details | Séminaire CANA |
|---|
| summary | Reaction systems are discrete dynamical systems that model biological processes in living cells using finite sets of reactants, inhibitors, and products. Synchronous Boolean networks can be viewed as a generalisation of this model.
In this talk, we will investigate the computational complexity of a comprehensive set of problems related to the existence of fixed points and attractors in three constrained classes of reaction systems: inhibitorless, reactantless and additive (in which each reaction involves at most one reactant and no inhibitors).
We will see that although the absence of reactants or inhibitors simplifies the system’s dynamics, it does not always lead to a reduction in the complexity of the considered problems for inhibitorless/reactantless reaction systems. Furthermore, all considered problems are polynomially solvable in additive systems using a polynomially computable graph representation.
I will also introduce some open questions and future research directions. |
|---|
| responsibles | NC |
|---|
Workflow history| from state (1) | to state | comment | date |
|---|
| submitted | published | | 2024/07/04 15:04 UTC |
| |
|