Discrete-time stochastic systems are an essential modelling tool for many engineering systems. We consider stochastic control systems that are evolving over continuous spaces. For this class of models, methods for the formal verification and synthesis of control strategies are computationally hard and generally rely on the use of approximate abstractions. Building on approximate abstractions, we compute control strategies with lower- and upper-bounds for satisfying unbounded temporal logic specifications. Firstly, robust dynamic programming mappings over the abstract system are introduced to solve the control synthesis and verification problem. These mappings yield a control strategy and a unique lower bound on the satisfaction probability for temporal logic specifications that is robust to the incurred approximation errors. Secondly, upper-bounds on the satisfaction probability are quantified, and properties of the mappings are analysed and discussed. Finally, we show the implications of these results to continuous state space of linear stochastic dynamic systems. This abstraction-based synthesis framework is shown to be able to handle infinite-horizon properties.

We derive direct data-driven dissipativity analysis methods for Linear Parameter-Varying (LPV) systems using a single sequence of input-scheduling-output data. By means of constructing a semi-definite program subject to linear matrix inequality constraints based on this data-dictionary , direct data-driven verification of $(Q,S,R)$ -type of dissipativity properties of the data-generating LPV system is achieved. Multiple implementation methods are proposed to achieve efficient computational properties and to even exploit structural information on the scheduling, e.g., rate bounds. The effectiveness and trade-offs of the proposed methodologies are shown in simulation studies of academic and physically realistic examples.

Automatically synthesizing controllers for continuous-state nonlinear stochastic systems, while giving guarantees on the probability of satisfying (infinite-horizon) temporal logic specifications crucially depends on abstractions with a quantified accuracy. For this similarity quantification, approximate stochastic simulation relations are often used. To handle the nonlinearity of the system effectively, we use finite-state abstractions based on piecewise-affine approximations together with tailored simulation relations that leverage the local affine structure. In the end, we synthesize a robust controller for a nonlinear stochastic Van der Pol oscillator.

Current state-of-the-art correct-by-design controllers are designed for full-state measurable systems. This work extends the applicability of correct-by-design controllers to partially observable linear, time-invariant (LTI) models. Towards the certification of the synthesised controllers, approximate simulation relations are leveraged to attain a quantification for the accuracy of introduced approximations. Additionally, the robustness of the approach allows the extension to models with the presence of probabilistic disturbances on state transitions and on output measurements. In a case study from smart buildings we evaluate the new output-based correct-by-design controller on a physical system with limited sensor information.

This paper addresses the problem of data-driven computation of controllers that are correct by design for safety-critical systems and can provably satisfy (complex) functional requirements. With a focus on continuous-space stochastic systems with parametric uncertainty, we propose a two-stage approach that decomposes the problem into a learning stage and a robust formal controller synthesis stage. The first stage utilizes available Bayesian regression results to compute robust credible sets for the true parameters of the system. For the second stage, we introduce methods for systems subject to both stochastic and parametric uncertainties. We provide simulation relations for enabling correct-by-design control refinement that are founded on coupling uncertainties of stochastic systems via sub-probability measures. The presented relations are essential for constructing abstract models that are related to not only one model but to a set of parameterized models. The results are demonstrated on three case studies, including a nonlinear and a high-dimensional system.