Compositional Synthesis of Finite-State Abstractions

DOI10.1109/TAC.2018.2869740MaRDI QIDQ5223778zbMATH OpenOpenAlexFDO

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

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

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

Cited in

(13)

• Compositional construction of abstractions for infinite networks of discrete-time switched systems
• Safety synthesis for incrementally stable switched systems using discretization-free multi-resolution abstractions
• Assume-guarantee contracts for continuous-time systems
• Optimal mixed discrete-continuous planning for linear hybrid systems
• Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations
• Verification of approximate opacity for switched systems: a compositional approach
• 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 infinite networks of control systems: a compositional approach
• Compositional generation of home states in free choice nets
• Compositional synthesis of opacity-preserving finite abstractions for interconnected systems
• Robust approximate symbolic models for a class of continuous-time uncertain nonlinear systems via a control interface
• Lazy abstraction-based controller synthesis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223778)