[jd115]

The paper explores the connection between two mathematical models used to study biological systems: Boolean networks and Petri nets.

Boolean networks model gene regulation and other biological processes using logical functions. The long-term behavior of these models, represented by "attractors", corresponds to observable biological states. Recently, a concept called "trap spaces" has made analyzing larger Boolean network models feasible. However, computing trap spaces relies on finding prime implicants of the logical functions, which gets harder as models get bigger and more complex.

(A prime implicant is a minimal set of conditions that ensures a Boolean function will be true. )

Petri nets are another type of model using places, transitions between places, and tokens to represent the state of a system. A key concept in Petri nets is a "siphon" - a set of places that once empty of tokens, remains empty.

The authors prove for the first time that there is an equivalence between trap spaces in a Boolean network and "conflict-free siphons" in the corresponding Petri net representation.

This connection allows properties of trap spaces to be studied using Petri net theory. It also enables a new approach to compute trap spaces by finding siphons in the Petri net, avoiding the hard prime implicant computation.

In practical terms, this pushes the boundaries of the size and complexity of biological systems that can be effectively modeled and studied using this approach.

[tgv]

And in reverse, does this offer any way to speed up finding factors of boolean networks?

[burnished]

Thank you for the explanation!

[ActionHank]

Thank you!