pith. sign in

arxiv: 1512.03267 · v3 · pith:MBBRSEVZnew · submitted 2015-12-10 · 🧮 math.OC · cs.FL

Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication

classification 🧮 math.OC cs.FL
keywords supervisorsdecentralizedlocalspecificationachievecommunicationcomputationconditions
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.