Structured Synthesis for Probabilistic Systems

07/16/2018
by   Nils Jansen, et al.
0

We introduce the concept of structured synthesis for Markov decision processes where the structure is induced from finitely many pre-specified options for a system configuration. The resulting synthesis problem is in general a nonlinear programming problem (NLP) with integer variables. As solving NLPs is in general not feasible, we present an alternative approach. We present a transformation of models specified in the PRISM probabilistic programming language to models that account for all possible system configurations by means of nondeterministic choices. Together with a control module that ensures consistent configurations throughout the system, this transformation enables the use of optimized tools for model checking in a black-box fashion. While this transformation increases the size of a model, experiments with standard benchmarks show that the method provides a feasible approach for structured synthesis. Moreover, we demonstrate the usefulness along a realistic case study involving surveillance by unmanned aerial vehicles in a shipping facility.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/23/2021

BF++: a language for general-purpose program synthesis

Most state of the art decision systems based on Reinforcement Learning (...
research
04/01/2020

Statistically Model Checking PCTL Specifications on Markov Decision Processes via Reinforcement Learning

Probabilistic Computation Tree Logic (PCTL) is frequently used to formal...
research
10/24/2017

Permissive Finite-State Controllers of POMDPs using Parameter Synthesis

We study finite-state controllers (FSCs) for partially observable Markov...
research
07/15/2023

Probabilistic Black-Box Checking via Active MDP Learning

We introduce a novel methodology for testing stochastic black-box system...
research
06/30/2021

Convex Optimization for Parameter Synthesis in MDPs

Probabilistic model checking aims to prove whether a Markov decision pro...
research
03/23/2018

Counterexamples for Robotic Planning Explained in Structured Language

Automated techniques such as model checking have been used to verify mod...

Please sign up or login with your details

Forgot password? Click here to reset