Compositional abstraction of large-scale stochastic systems: a relaxed dissipativity approach
From MaRDI portal
Publication:2178236
Abstract: In this paper, we propose a compositional approach for the construction of finite abstractions (a.k.a. finite Markov decision processes (MDPs)) for networks of discrete-time stochastic control subsystems that are not necessarily stabilizable. The proposed approach leverages the interconnection topology and a notion of finite-step stochastic storage functions, that describes joint dissipativity-type properties of subsystems and their abstractions, and establishes a finite-step stochastic simulation function as a relation between the network and its abstraction. To this end, we first develop a new type of compositionality conditions which is less conservative than the existing ones. In particular, using a relaxation via a finite-step stochastic simulation function, it is possible to construct finite abstractions such that stabilizability of each subsystem is not necessarily required. We then propose an approach to construct finite MDPs together with their corresponding finite-step storage functions for general discrete-time stochastic control systems satisfying an incremental passivablity property. We also construct finite MDPs for a particular class of nonlinear stochastic control systems. To demonstrate the effectiveness of the proposed results, we apply our results on three different case studies.
Recommendations
- Compositional construction of infinite abstractions for networks of stochastic control systems
- Compositional abstraction-based synthesis for networks of stochastic switched systems
- From dissipativity theory to compositional construction of finite Markov decision processes
- Compositional synthesis of finite abstractions for networks of systems: a small-gain approach
- Compositional abstraction-based synthesis for continuous-time stochastic hybrid systems
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A Contraction Theory Approach to Stochastic Incremental Stability
- A Lyapunov approach to incremental stability properties
- A compositional modelling and analysis framework for stochastic hybrid systems
- A new asymptotic stability criterion for nonlinear time-variant differential equations
- Adaptive and sequential gridding procedures for the abstraction and verification of stochastic processes
- An alternative converse Lyapunov theorem for discrete-time systems
- Approximately bisimilar symbolic models for randomly switched stochastic systems
- Approximations of Stochastic Hybrid Systems
- Approximations of Stochastic Hybrid Systems: A Compositional Approach
- Bisimulation through probabilistic testing
- Compositional (In)Finite Abstractions for Large-Scale Interconnected Stochastic Systems
- Compositional abstraction-based synthesis for networks of stochastic switched systems
- Compositional construction of infinite abstractions for networks of stochastic control systems
- Compositional controller synthesis for stochastic games
- Compositional probabilistic verification through multi-objective model checking
- Dynamic Bayesian networks for formal verification of structured stochastic processes
- From dissipativity theory to compositional construction of finite Markov decision processes
- Gershgorin's Theorem and the Zeros of Polynomials
- Networks of dissipative systems. Compositional certification of stability, performance, and safety
- Non-conservative discrete-time ISS small-gain conditions for closed sets
- On stability analysis methods for large-scale discrete-time systems
- Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
- Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions
- Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems
- Robust PCTL model checking
- Symbolic Control of Stochastic Systems via Approximately Bisimilar Finite Abstractions
- Symbolic models for stochastic switched systems: A discretization and a discretization-free approach
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
Cited in
(12)- Compositional abstraction-based synthesis for networks of stochastic switched systems
- Compositional construction of abstractions for infinite networks of discrete-time switched systems
- Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations
- Distributionally Robust Strategy Synthesis for Switched Stochastic Systems
- Abstraction-based synthesis for stochastic systems with omega-regular objectives
- Abstractions of networks of stochastic hybrid systems under randomly switched topologies: a compositional approach
- Symbolic models for infinite networks of control systems: a compositional approach
- Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations
- Automated verification and synthesis of stochastic hybrid systems: a survey
- From dissipativity theory to compositional construction of finite Markov decision processes
- Compositional construction of infinite abstractions for networks of stochastic control systems
- Abstraction for Stochastic Systems by Erlang’s Method of Stages
This page was built for publication: Compositional abstraction of large-scale stochastic systems: a relaxed dissipativity approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178236)
