# Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication

@article{Komenda2017ComputationOC, title={Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication}, author={Jan Komenda and Tomas Masopust}, journal={Discrete Event Dynamic Systems}, year={2017}, volume={27}, pages={585-608} }

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…

## 11 Citations

### Complexity of Infimal Observable Superlanguages Tomáš Masopust

- Computer Science
- 2017

It is proved that there is no polynomial-time algorithm that computes an NFA of the supremal prefix-closed sublanguage of a language given as an N FA even if the language is unary.

### Mean Payoff Supervisory Control Under Partial Observation

- Mathematics2018 IEEE Conference on Decision and Control (CDC)
- 2018

This work intends to design a partial-observation supervisor such that the limit-average weights of all infinite sequences in the supervised system remain nonnegative, and proposes a finite bipartite structure called First Cycle Energy Inclusive Controller (FCEIC).

### Optimal Stabilization of Discrete Event Systems with Guaranteed Worst Cost

- Computer Science, Mathematics
- 2020

### Complexity of Infimal Observable Superlanguages

- Computer ScienceIEEE Transactions on Automatic Control
- 2018

The construction shows that such a DFA can be computed in time and shows that the upper bound state complexity on the infimal prefix-closed and observable superlanguage is $2^n + 1$ and that this bound is asymptotically tight.

### Supervisory Control under Local Mean Payoff Constraints

- Economics, Mathematics2019 IEEE 58th Conference on Decision and Control (CDC)
- 2019

This work investigates quantitative supervisory control with a local mean payoff objective for weighted discrete event systems and develops a method to synthesize game-winning supervisors, which solve the proposed problem.

### Local Mean Payoff Supervisory Control for Discrete Event Systems

- MathematicsIEEE Transactions on Automatic Control
- 2022

This work investigates quantitative supervisory control with local mean payoff objectives on discrete event systems modeled as weighted automata by focusing on the mean weight over a finite number of events, which serves as a measure to reflect the stability or robustness of the weight flows.

### Localisation-based distributed control of timed discrete-event systems with communication delay

- Computer ScienceInt. J. Control
- 2022

There exist multiple distinct observable event sets; thus, timed relative coobservability is employed to synthesise partial-observation decentralised supervisors and localisation-based distributed control of timed multi-component discrete-event systems with communication delay in the Brandin–Wonham framework is studied.

### Optimal supervisory control with mean payoff objectives and under partial observation

- Computer ScienceAutom.
- 2021

### Partially Ordered Automata and Piecewise Testability

- Computer ScienceLog. Methods Comput. Sci.
- 2021

It is shown that deciding universality for general ptNFAs is as hard as for general NFAs, and a novel and nontrivial extension of the recent construction for self-loop-deterministic partially ordered NFAs is built, a model strictly more expressive than pt NFAs.

### Supervisory Control for Stabilization under Multiple Local Average Payoff Constraints

- Mathematics, Economics2021 60th IEEE Conference on Decision and Control (CDC)
- 2021

This work investigates stabilization of discrete event systems via supervisory control under a series of quantitative constraints. Every event in the system model is weighted by a vector which…

## References

SHOWING 1-10 OF 61 REFERENCES

### A bridge between decentralized and coordination control

- Computer Science2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2013

This paper shows how recent results in coordination control of modular discrete-event systems help to construct a coobservable sublanguage in a computationally cheap way.

### Supervisory control synthesis of discrete-event systems using a coordination scheme

- MathematicsAutom.
- 2012

### The infimal closed controllable superlanguage and its application in supervisory control

- Mathematics
- 1990

It is shown that the computation of the infimal closed controllable superlanguage plays a central role in problems that involve a tradeoff between satisficing and blocking.

### On a distributed computation of supervisors in modular supervisory control

- Mathematics2015 International Conference on Complex Systems Engineering (ICCSE)
- 2015

A supervisory control problem of modular discrete-event systems that admits a distributed computation of supervisors is discussed and a characterization and an algorithm to compute the supervisors are provided.

### Decentralized supervisory control with communicating controllers

- MathematicsIEEE Trans. Autom. Control.
- 2000

The decentralized control problem for discrete-event systems addressed in this paper is that of several communicating supervisory controllers, each with different information, working in concert to…

### Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator

- Mathematics, Computer ScienceSyst. Control. Lett.
- 2011

### Effective computation of an Lm(G)-closed, controllable, and observable sublanguage arising in supervisory control

- MathematicsSyst. Control. Lett.
- 2003

### Relative observability in coordination control

- Mathematics2015 IEEE International Conference on Automation Science and Engineering (CASE)
- 2015

It is proved that conditional normality is stronger than conditional relative observability, hence it can be used in coordination control instead of conditional normalities.

### Optimal Supervisory Control of Discrete Event DynamicalSystems

- Mathematics
- 1995

The notion of optimal supervisory control of discrete event dynamical systems (DEDSs) is formalized in the framework of Ramadge and Wonham. A DEDS is modeled as a state machine and is controlled by…

### Relative Observability of Discrete-Event Systems and Its Supremal Sublanguages

- MathematicsIEEE Transactions on Automatic Control
- 2015

This work identifies a new observability concept, called relative observability, in supervisory control of discrete-event systems under partial observation, and designs new algorithms which compute the supremal relatively observable sublanguage of a given language, which is generally larger than the normal counterpart.