Compositional Synthesis of Finite-State Abstractions

DOI10.1109/TAC.2018.2869740zbMath1482.93263OpenAlexW2561773129MaRDI QIDQ5223778

Kaushik Mallik, Rupak Majumdar, Anne-Kathrin Schmuck, Sadegh Soudjani

Publication date: 18 July 2019

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

Full work available at URL: https://doi.org/10.1109/tac.2018.2869740

Mathematics Subject Classification ID

Synthesis problems (93B50) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by ordinary differential equations (93C15) Temporal logic (03B44)

Related Items (12)

Compositional construction of abstractions for infinite networks of discrete-time switched systems ⋮ Compositional synthesis of opacity-preserving finite abstractions for interconnected systems ⋮ Assume-guarantee contracts for continuous-time systems ⋮ Optimal mixed discrete-continuous planning for linear hybrid systems ⋮ Lazy Abstraction-Based Controller Synthesis ⋮ Compositional construction of infinite abstractions for networks of stochastic control systems ⋮ Compositional synthesis of finite abstractions for networks of systems: a small-gain approach ⋮ Safety synthesis for incrementally stable switched systems using discretization-free multi-resolution abstractions ⋮ 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

This page was built for publication: Compositional Synthesis of Finite-State Abstractions