Symbolic Models for Networks of Control Systems

DOI10.1109/TAC.2016.2528046zbMath1359.93039OpenAlexW2342916981MaRDI QIDQ2980313

Pierdomenico Pepe, Maria Domenica Di Benedetto, Giordano Pola

Publication date: 3 May 2017

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

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Compositional synthesis of opacity-preserving finite abstractions for interconnected systems ⋮ Approximate predictability of pseudo-metric systems ⋮ Abstraction-based control synthesis using partial information ⋮ A small-gain theorem for set stability of infinite networks: distributed observation and ISS for time-varying networks ⋮ Approximate current state observability of discrete-time nonlinear systems under cyber-attacks ⋮ Abstractions of networks of stochastic hybrid systems under randomly switched topologies: a compositional approach ⋮ Decentralized abstractions for multi-agent systems under coupled constraints ⋮ Optimal multirate sampling in symbolic models for incrementally stable switched 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 ⋮ Finite horizon discrete models for multi-agent control systems with coupled dynamics ⋮ Verification of approximate opacity for switched systems: a compositional approach ⋮ Symbolic models for infinite networks of control systems: a compositional approach ⋮ Abstractions of Varying Decentralization Degree for Reachability of Coupled Multiagent Systems