DeepAI AI Chat
Log In Sign Up

Parameter Space Abstraction and Unfolding Semantics of Discrete Regulatory Networks

by   Juraj Kolčák, et al.

The modelling of discrete regulatory networks combines a graph specifying the pairwise influences between the variables of the system, and a parametrisation from which can be derived a discrete transition system. Given the influence graph only, the exploration of admissible parametrisations and the behaviours they enable is computationally demanding due to the combinatorial explosions of both parametrisation and reachable state space. This article introduces an abstraction of the parametrisation space and its refinement to account for the existence of given transitions, and for constraints on the sign and observability of influences. The abstraction uses a convex sublattice containing the concrete parametrisation space specified by its infimum and supremum parametrisations. It is shown that the computed abstractions are optimal, i.e., no smaller convex sublattice exists. Although the abstraction may introduce over-approximation, it has been proven to be conservative with respect to reachability of states. Then, an unfolding semantics for Parametric Regulatory Networks is defined, taking advantage of concurrency between transitions to provide a compact representation of reachable transitions. A prototype implementation is provided: it has been applied to several examples of Boolean and multi-valued networks, showing its tractability for networks with numerous components.


page 1

page 2

page 3

page 4


Combining Refinement of Parametric Models with Goal-Oriented Reduction of Dynamics

Parametric models abstract part of the specification of dynamical models...

Optimized State Space Grids for Abstractions

The practical impact of abstraction-based controller synthesis methods i...

Asynchronous Correspondences Between Hybrid Trajectory Semantics

We formalize the semantics of hybrid systems as sets of hybrid trajector...

An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis

The majority of existing Linear Temporal Logic (LTL) planning methods re...

An Empirical Study of the Effects of Spurious Transitions on Abstraction-based Heuristics

The efficient solution of state space search problems is often attempted...

Complex Networks of Functions

Functions correspond to one of the key concepts in mathematics and scien...

Most Permissive Semantics of Boolean Networks

As shown in [3], the usual update modes of Boolean networks (BNs), inclu...