Under-approximating Cut Sets for Reachability in Large Scale Automata Networks

  title={Under-approximating Cut Sets for Reachability in Large Scale Automata Networks},
  author={Lo{\"i}c Paulev{\'e} and Geoffroy Andrieux and Heinz Koeppl},
In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the local states from such a set are disabled in the model, the concerned reachability is impossible. Those sets are referred to as cut sets and are computed from a particular abstract causality structure, so-called Graph of Local Causality, inspired from previous… 
Goal-Oriented Reduction of Automata Networks
A reduction procedure tailored for reachability properties of the form “from global state \({s}\), there exists a sequence of transitions leading to a state where an automaton g is in a local state \(\top \)” that can shrink down significantly the reachable state space.
Sufficient conditions for reachability in automata networks with priorities
Reduction of Qualitative Models of Biological Networks for Transient Dynamics Analysis
  • Loïc Paulevé
  • Computer Science
    IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • 2018
This paper describes a method to reduce a qualitative model for enhancing the tractability of analysis of transient reachability properties and shows that the reduction can lead to a drastic improvement for the scalability of verification methods.
Identification of bifurcation transitions in biological regulatory networks using Answer-Set Programming
This paper proposes a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable, which can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models.
Identification of Bifurcations in Biological Regulatory Networks using Answer-Set Programming
This paper proposes a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable, and applies its implementation on a regulatory network among hundreds of biological species, supporting the scalability of the approach.
On the Hardness of Reachability Reduction
A unified model of reachability reduction based on a kind of graph cut problem aiming to disconnect those reachable label pairs specified in advance by edge deletion while minimizing the number of pairs have to be disconnected is modeled, followed by some potential applications where the model can be applied.
Efficient analysis on very large models
The reachability problem that aims at deciding if, starting from a given initial state, it is possible to reach a given local state is defined and the static analysis method that was developed to answer to such problems in polynomial time is explained.
Maximum reachability preserved graph cut
Qualitative dynamics semantics for SBGN process description
The proposed semantics provide a direct formalization of SBGN-PD networks in dynamical qualitative models that can be further analyzed using standard tools for discrete models.


Static analysis of Biological Regulatory Networks dynamics using abstract interpretation
This paper settles an original approach for deciding reachability properties based on Process Hitting, which is a framework suitable for modelling dynamical complex systems and has been shown to be of interest in providing compact models of the dynamics of BRNs with discrete values.
Negative circuits and sustained oscillations in asynchronous automata networks
Boolean models of bistable biological systems
If a certain motif including a feedback loop is present in the wiring diagram of the system, the Boolean model captures the bistability of molecular switches and the method is applied to two examples from biology, the lac operon and the phage lysis/lysogeny switch.
Boolean formalization of genetic control circuits.
  • R. Thomas
  • Computer Science
    Journal of theoretical biology
  • 1973
Advances in Petri Nets 1992
  • G. Rozenberg
  • Computer Science
    Lecture Notes in Computer Science
  • 1992
Design methods based on nets with modular functional modelling of petri nets with individual tokens and a survey of equivalence notions for net based systems.
Minimal cut sets in biochemical reaction networks
This work addresses the analysis of potential failure modes in metabolic networks whose occurrence will render the network structurally incapable of performing certain functions, and introduces the concept of minimal cut sets for biochemical networks.
On the Complexity of Verifying Concurrent Transition Systems
The effect of concurrency on the complexity of implementation verification is investigated, and trace-based and tree-based approaches to the verification of concurrent transition systems, with and without fairness are considered.
Transactions on Computational Systems Biology XIII
The papers included illustrate the broad span of aspects of modeling and analysis of biological systems: evolution of a cell population with selection based on toxin resistance; a quantitative and tool-supported interpretation of flow abstraction in the Systems Biology Graphical Notation; an analytic approach to dynamic simulation of deformable biological structures; a new stochastic simulation algorithm reconsidering the delay-as-duration principle.
Minimal cut set/sequence generation for dynamic fault trees
  • Zhihua Tang, J. Dugan
  • Computer Science
    Annual Symposium Reliability and Maintainability, 2004 - RAMS
  • 2004
This paper proposes a zero-suppressed binary decision diagrams (ZBDD) based solution for minimal cut set/sequence (MCS) generation of dynamic fault trees, based on the basic ZBDD set manipulations.