A Control Strategy Algorithm for Finite Alternating Transition Systems
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.
Index Terms— alternating transition systems, finite abstraction, linear temporal logic, control strategy algorithm.
Department of Computer Science, Nanjing Audit University, CHINA
Jiangsu Key Laboratory of Audit Information Engineering, CHINA
Department of Computer Science, Nanjing Forestry University, CHINA
Cite: Jinjin Zhang, Yan Zhang, "A Control Strategy Algorithm for Finite Alternating Transition Systems," Proceedings of 2019 the 9th International Workshop on Computer Science and Engineering, pp. 970-976, Hong Kong, 15-17 June, 2019.