Bayesian Verification of Chemical Reaction Networks

04/23/2020
by   Gareth W. Molyneux, et al.
0

We present a data-driven verification approach that determines whether or not a given chemical reaction network (CRN) satisfies a given property, expressed as a formula in a modal logic. Our approach consists of three phases, integrating formal verification over models with learning from data. First, we consider a parametric set of possible models based on a known stoichiometry and classify them against the property of interest. Secondly, we utilise Bayesian inference to update a probability distribution of the parameters within a parametric model with data gathered from the underlying CRN. In the third and final stage, we combine the results of both steps to compute the probability that the underlying CRN satisfies the given property. We apply the new approach to a case study and compare it to Bayesian statistical model checking.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 12

12/12/2017

A Data-Driven Sparse-Learning Approach to Model Reduction in Chemical Reaction Networks

In this paper, we propose an optimization-based sparse learning approach...
12/27/2021

Towards the Verification of Strategic Properties in Multi-Agent Systems with Imperfect Information

In logics for the strategic reasoning the main challenge is represented ...
11/17/2018

Statistical Verification of Neural Networks

We present a new approach to neural network verification based on estima...
11/26/2018

Integrating Topological Proofs with Model Checking to Instrument Iterative Design

System development is not a linear, one-shot process. It proceeds throug...
09/22/2020

Property-Directed Verification of Recurrent Neural Networks

This paper presents a property-directed approach to verifying recurrent ...
05/08/2020

Data-Driven Verification under Signal Temporal Logic Constraints

We consider systems under uncertainty whose dynamics are partially unkno...
03/13/2020

On Sufficient and Necessary Conditions in Bounded CTL

Computation Tree Logic (CTL) is one of the central formalisms in formal ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.