SEAIFeb 28, 2017

Bayesian Verification under Model Uncertainty

arXiv:1702.08725v11 citations
Originality Incremental advance
AI Analysis

This addresses verification challenges in adaptive systems, but it is incremental as it builds on existing satisfaction functions.

The paper tackles the problem of runtime verification for systems that learn models from limited data, which introduces uncertainty, by proposing a definition of subjective satisfaction and a Bayesian algorithm (BV) that provides user-definable error bounds.

Machine learning enables systems to build and update domain models based on runtime observations. In this paper, we study statistical model checking and runtime verification for systems with this ability. Two challenges arise: (1) Models built from limited runtime data yield uncertainty to be dealt with. (2) There is no definition of satisfaction w.r.t. uncertain hypotheses. We propose such a definition of subjective satisfaction based on recently introduced satisfaction functions. We also propose the BV algorithm as a Bayesian solution to runtime verification of subjective satisfaction under model uncertainty. BV provides user-definable stochastic bounds for type I and II errors. We discuss empirical results from an example application to illustrate our ideas.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes