The Controllability Prefix for Supervisory Control under Partial Observation with an Application to Fault-Tolerant Control

Date

2017-07-01

Author

Moor, Thomas
Schmidt, Klaus Verner

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

3
views

0
downloads

The controllability prefix is known as a useful concept for the discussion and solution of synthesis problems in supervisory control of cp-languages, i.e., formal languages of infinite-length words. There, the controllability prefix is defined as the set of all finite-length prefixes that can be controlled to satisfy prescribed liveness and safety properties. In this paper, we discuss a variation of the controllability prefix to address supervisory control under partial observation for regular *-languages, i.e., formal languages of finite-length words. We derive algebraic properties that are useful for a quantitative analysis on how an upper-bound language-inclusion specification affects achievable lower-bound specifications. Our study is motivated by the synthesis of fault-tolerant supervisory controllers, where the possible occurrence of a fault may restrict the achievable pre-fault behaviour so severe, that a relaxation of the upper-bound specification becomes a practical option. As our study shows, such a relaxation can be systematically constructed in terms of the controllability prefix. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

Subject Keywords

Partial observation, Fault-tolerant control, Supervisory control, Discrete-event systems

URI

https://hdl.handle.net/11511/37925

Collections

Department of Electrical and Electronics Engineering, Article