Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication
Optimization and Control
2017-11-15 v3 Formal Languages and Automata Theory
Abstract
In decentralized supervisory control, several local supervisors cooperate to accomplish a common goal (specification). Controllability and coobservability are the key conditions to achieve a specification in the controlled system. We construct a controllable and coobservable sublanguage of the specification by using additional communications between supervisors. Namely, we extend observable events of local supervisors via communication and apply a fully decentralized computation of local supervisors. Coobservability is then guaranteed by construction. Sufficient conditions to achieve the centralized optimal solution are discussed. Our approach can be used for both prefix-closed and non-prefix-closed specifications.
Keywords
Cite
@article{arxiv.1512.03267,
title = {Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication},
author = {Jan Komenda and Tomáš Masopust},
journal= {arXiv preprint arXiv:1512.03267},
year = {2017}
}