Bayesian Statistical Model Checking for Multi-agent Systems using HyperPCTL*

by   Spandan Das, et al.
Kansas State University

In this paper, we present a Bayesian method for statistical model checking (SMC) of probabilistic hyperproperties specified in the logic HyperPCTL* on discrete-time Markov chains (DTMCs). While SMC of HyperPCTL* using sequential probability ratio test (SPRT) has been explored before, we develop an alternative SMC algorithm based on Bayesian hypothesis testing. In comparison to PCTL*, verifying HyperPCTL* formulae is complex owing to their simultaneous interpretation on multiple paths of the DTMC. In addition, extending the bottom-up model-checking algorithm of the non-probabilistic setting is not straight forward due to the fact that SMC does not return exact answers to the satisfiability problems of subformulae, instead, it only returns correct answers with high-confidence. We propose a recursive algorithm for SMC of HyperPCTL* based on a modified Bayes' test that factors in the uncertainty in the recursive satisfiability results. We have implemented our algorithm in a Python toolbox, HyProVer, and compared our approach with the SPRT based SMC. Our experimental evaluation demonstrates that our Bayesian SMC algorithm performs better both in terms of the verification time and the number of samples required to deduce satisfiability of a given HyperPCTL* formula.


The Bouquet Algorithm for Model Checking Unbounded Until

The problem of verifying the "Unbounded Until" fragment in temporal logi...

Probabilistic Model Checking for Continuous Time Markov Chains via Sequential Bayesian Inference

Probabilistic model checking for systems with large or unbounded state s...

Statistical Model Checking for Probabilistic Hyperproperties

In this paper, we propose the temporal logic HyperPCTL^* that extends PC...

On Verifying Timed Hyperproperties

We study the satisfiability and model-checking problems for timed hyperp...

Revisiting MITL to Fix Decision Procedures

Metric Interval Temporal Logic (MITL) is a well studied real-time, tempo...

Base-based Model Checking for Multi-Agent Only Believing (long version)

We present a novel semantics for the language of multi-agent only believ...

Proving Non-Inclusion of Büchi Automata based on Monte Carlo Sampling

The search for a proof of correctness and the search for counterexamples...

Please sign up or login with your details

Forgot password? Click here to reset