2014/03/20 by Jan Komenda, Komenda, Jan, Tomáš Masopust +1
Computer Science · Mathematics · Social Sciences · #Access Control and Trust #Computers and Society (cs.CY) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Logic, Reasoning, and Knowledge #Optimization and Control (math.OC) #Petri Nets in System Modeling #cs.CY #cs.FL #math.OC
paper · pdf · doi:10.48550/arxiv.1403.5170
arxiv created 2014/03/20 · openalex publication_date 2014/03/20 · arxiv updated 2014/03/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we present a new approach to decentralized supervisory control of large automata with communicating supervisors. We first generalize the recently developed top-down architecture of multilevel coordination control with a hierarchical structure of groups of subsystems, their respective coordinators and supervisors. Namely, in the case where the equivalent conditions for achieving a specification language fail to be satisfied, we propose sufficient conditions for a distributed computation of the supremal achievable sublanguage. We then apply the obtained constructive results of multilevel coordination control to decentralized supervisory control with communication, where local supervisors of subsystems within a group communicate with each other via the coordinator of the group. Our approach is illustrated by an example.