BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Sara Riva (Université de Lille) DTSTART:20260129T190000Z DTEND:20260129T200000Z DTSTAMP:20260423T021358Z UID:OLS/198 DESCRIPTION:Title: Co ntrol and synthesis of minimal trap spaces in Boolean Network\nby Sara Riva (Université de Lille) as part of Online logic seminar\n\n\nAbstract \nSince recent years\, we observe a surge of successful applications of Bo olean networks (BNs) in biology and medicine for the modeling and predicti on of cellular dynamics in the case of cancer and cellular reprogramming. Such applications face two main challenges: being able to design a qualita tive Boolean model which is faithful to the behavior of the biological sys tem and being able to compute predictions to control its (long-term) dynam ics. From a computational point of view\, the latter problem mostly depend s on the complexity of the dynamical property to enforce\, while the forme r additionally suffers from the combinatorics of candidate models.\n\nMini mal trap spaces (MTSs) capture subspaces in which the Boolean dynamics is trapped\, whatever the update mode. They correspond to the attractors of t he most permissive mode. Due to their versatility\, the computation of MTS s has recently gained traction\, essentially by focusing on their enumerat ion. We address the logical reasoning on universal properties of MTSs in t he scope of two problems: the reprogramming of Boolean networks for identi fying the permanent freeze of Boolean variables that enforce a given prope rty on all the MTSs\, and the synthesis of Boolean networks from universal properties on their MTSs. Both problems reduce to solving the satisfiabil ity of quantified propositional logic formula with 3 levels of quantifiers .\n LOCATION:https://researchseminars.org/talk/OLS/198/ END:VEVENT END:VCALENDAR