On Checking Properties of Decentralized Controlled Discrete-Event Systems<bold> </bold>

In spite of intensive study since 1980s, there are still a lot of open problems in the supervisory control theory of discreteevent systems (DES), especially partially observed and decentralized ones, due to complexity issues of supervisor's construction and verification algorithms. An important problem is the decentralized supervisory control, implemented by a set of automata each observing its own part of the system behavior. Preservation of co-observability of specification languages for DES under state space reduction, which is applied to reduce SCT algorithms computational complexity, is studied. One popular automata abstraction is considered and conditions for its applicability are obtained using the method of logical-algebraic equations.<bold> </bold>