Disentangling a complex response in cell reprogramming and probing the Waddington landscape by automatic construction of Petri nets. Abstract   We analyzed the developmental switch to sporulation of a multinucleate Physarum polycephalum plasmodial cell, a complex response to phytochrome photoreceptor activation. Automatic construction of Petri nets representing finite state machines assembled from trajectories of differential gene expression in single cells revealed alternative, genotypedependent interconnected developmental routes and identified reversible steps, metastable states, commitment points, and subsequent irreversible steps together with molecular signatures associated with cell fate decision and differentiation. Formation of cyclic transits identified by transition invariants in mutants that are locked in a proliferative state is remarkable considering the view that oncogenic alterations may cause the formation of cancer attractors. We conclude that the Petri net approach is useful to probe the Waddington landscape of cellular reprogramming, to disentangle developmental routes for the reconstruction of the gene regulatory network, and to understand how genetic alterations or physiological conditions reshape the landscape eventually creating new basins of attraction. Unraveling the complexity of pathogenesis, disease progression, drug response or the analysis of attractor landscapes in other complex systems of uncertain structure might be additional fields of application.

Synthesis of Boolean Networks from Biological Dynamical Constraints using AnswerSet Programming Boolean networks model finite discrete dynamical systems with complex behaviours. The state of each component is determined by a Boolean function of the state of (a subset of) the components of the network. This paper addresses the synthesis of these Boolean functions from constraints on their domain and emerging dynamical properties of the resulting network. The dynamical properties relate to the existence and absence of trajectories between partially observed configurations, and to the stable behaviours (fixpoints and cyclic attractors). The synthesis is expressed as a Boolean satisfiability problem relying on AnswerSet Programming with a parametrized complexity, and leads to a complete nonredundant characterization of the set of solutions. Considered constraints are particularly suited to address the synthesis of models of cellular differentiation processes, as illustrated on a case study. The scalability of the approach is demonstrated on random networks with scalefree structures up to 100 to 1,000 nodes depending on the type of constraints.