English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Petri-nets are a simple formalism for modeling concurrent computation.Recently, they have emerged as a powerful tool for the modeling and analysis ofbiochemical reaction networks, bridging the gap between purely qualitative andquantitative models. These networks can be large and complex, which makes theirstudy difficult and computationally challenging. In this paper, we focus on twostructural properties of Petri-nets, siphons and traps, that bring usinformation about the persistence of some molecular species. We present twomethods for enumerating all minimal siphons and traps of a Petri-net byiterating the resolution of a boolean model interpreted as either a SAT or aCLP(B) program. We compare the performance of these methods with astate-of-the-art dedicated algorithm of the Petri-net community. We show thatthe SAT and CLP(B) programs are both faster. We analyze why these programsperform so well on the models of the repository of biological modelsbiomodels.net, and propose some hard instances for the problem of minimalsiphons enumeration.

Un mod\`ele bool\'een pour l'\'enum\'eration des siphons et des pi\`eges minimaux dans les r\'eseaux de Petri