A control strategy algorithm for finite alternating transition systems

TL;DR

This paper introduces a control strategy algorithm for finite alternating transition systems, enabling the enforcement of linear temporal logic specifications on approximate finite abstractions of control systems with disturbances.

Contribution

It presents a novel algorithm to synthesize control strategies for finite abstractions, extending prior work by Pola and Tabuada to enforce temporal logic specifications.

Findings

Algorithm successfully synthesizes control strategies for complex specifications.

Enables formal verification and control of systems with disturbances.

Improves scalability of control synthesis methods.

Abstract

Recently, there has been an increasing interest in the formal analysis and design of control systems. In this area, in order to reduce the complexity and scale of control systems, finite abstractions of control systems are introduced and explored. Amongst, Pola and Tabuada construct finite alternating transition systems as approximate finite abstractions for control systems with disturbance inputs [SIAM Journal on Control and Optimization, Vol. 48, 2009, 719-733]. Given linear temporal logical formulas as specifications, this paper provides a control strategy algorithm to find control strategies of Pola and Tabuada's abstractions enforcing specifications.