Symbolic Control of Stochastic Systems via Approximately Bisimilar Finite Abstractions

DOI10.1109/TAC.2014.2351652zbMath1360.93445arXiv1302.3868OpenAlexW2047671935MaRDI QIDQ2982915

Majid Zamani, Peyman Mohajerin Esfahani, Alessandro Abate, John Lygeros, Rupak Majumdar

Publication date: 16 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.3868

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Synthesis problems (93B50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Stochastic systems in control theory (general) (93E03)

Related Items

Approximately bisimilar symbolic model for switched systems with unstable subsystems ⋮ Similarity quantification for linear stochastic systems: a coupling compensator approach ⋮ Compositional abstraction-based synthesis for networks of stochastic switched systems ⋮ Probabilistic reachability and control synthesis for stochastic switched systems using the tamed Euler method ⋮ Compositional abstraction of large-scale stochastic systems: a relaxed dissipativity approach ⋮ Abstraction-based control synthesis using partial information ⋮ Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement ⋮ Symbolic models for stochastic switched systems: A discretization and a discretization-free approach ⋮ Estimating infinitesimal generators of stochastic systems with formal error bounds ⋮ Towards scalable synthesis of stochastic control systems ⋮ Abstractions of networks of stochastic hybrid systems under randomly switched topologies: a compositional approach ⋮ Optimal multirate sampling in symbolic models for incrementally stable switched systems ⋮ Compositional abstraction-based synthesis for continuous-time stochastic hybrid systems ⋮ Approximately bisimilar symbolic models for randomly switched stochastic systems ⋮ Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations ⋮ On distributed symbolic control of interconnected systems under persistency specifications ⋮ Compositional construction of infinite abstractions for networks of stochastic control systems ⋮ Compositional synthesis of finite abstractions for networks of systems: a small-gain approach ⋮ Symbolic models for retarded jump-diffusion systems ⋮ Verification of approximate opacity for switched systems: a compositional approach ⋮ Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations ⋮ Symbolic models for infinite networks of control systems: a compositional approach ⋮ Robust approximate symbolic models for a class of continuous-time uncertain nonlinear systems via a control interface ⋮ Automated verification and synthesis of stochastic hybrid systems: a survey