On coparanormality in distributed supervisory control of discrete‐event systems

Saeidi, Vahid; Afzalian, Ali A.; Gharavian, Davood

doi:10.1002/asjc.2349

Cited by 2 publications

(4 citation statements)

References 29 publications

(85 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This procedure cannot guarantee event reduction in each local controller comparing to the reduced original supervisor. Supervisor localization procedure has been extended in [12], based on coparanormality property, for non-modular plants. Also, this procedure has been extended in [13], based on relative observability property [14], in a case, the supervisor has partial observation to the plant.…”

Section: Introductionmentioning

confidence: 99%

“…a,b). According to(12), 𝜎 is defined at corresponding states 𝑞 ≠ 𝑞′ in 𝐆 (Fig.1.c). Hence, 𝜎 appears as a transition from 𝑧 𝑖 (Fig.1.e).…”

mentioning

confidence: 99%

“…Hence, 𝜎 appears as a transition from 𝑧 𝑖 (Fig.1.e). But, according to(12), we know that 𝑞 𝑖 ≠ 𝑞 𝑗 (Fig.1.c). Therefore, 𝜎 is a self-loop transition at 𝑧 𝑖 𝑘 , as shown in Fig.1.d.Similarly, the proposition can be proved for 𝜎 ∈ 𝐸(𝑥′) ∩ 𝐷(𝑥).…”

mentioning

confidence: 99%

See 2 more Smart Citations

Event Reduction in Localization of DES Supervisory Control

Saeidi,

Afzalian,

Gharavian

2023

Preprint

Self Cite

View full text Add to dashboard Cite

Supervisor localization procedure has been employed to construct local controllers corresponding to component agents in discrete-event systems. The proposed method in [11] is based on state reduction of a monolithic supervisor with respect to each set of controllable events corresponding to each component agent. A supervisor is localizable if state cardinality in each local controller is less than the number of states in the reduced supervisor, constructed by the proposed method in [10]. A supervisor is reducible if state cardinality of the constructed generator by the supervisor reduction procedure is less than the number of states of the original supervisor. In this paper, we define exclusive control consistency (ECC) property for a pair of states and prove that this property is a sufficient condition to guarantee reducing the event cardinality in each local controller comparing to the reduced supervisor. It is shown that reducibility and localizability properties are stronger than having ECC states in the original supervisor. The implementation of local controllers on industrial systems is facilitated by state reduction, whereas communication traffic between each pair of local controllers is reduced by event reduction.

show abstract

Section: Introductionmentioning

confidence: 99%

“…a,b). According to(12), 𝜎 is defined at corresponding states 𝑞 ≠ 𝑞′ in 𝐆 (Fig.1.c). Hence, 𝜎 appears as a transition from 𝑧 𝑖 (Fig.1.e).…”

mentioning

confidence: 99%

See 1 more Smart Citation

Event Reduction in Localization of DES Supervisory Control

Saeidi,

Afzalian,

Gharavian

2023

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…There are many approaches to tackle the state explosion problem, including using various supervisory control architectures, such as dencentralized supervisory control [3], hierarchical supervisory control [4], and distributed supervisory control [5,6]. In addition, symbolic represen-tation of the state space, such as state tree structures (STS) [7,8], is also an effective way to deal with this problem.…”

Section: Introductionmentioning

confidence: 99%

On efficient relabeling of symmetric discrete‐event systems

Jiao

Bai

2021

Asian Journal of Control

View full text Add to dashboard Cite

Symmetric discrete-event systems (SDES) are composed of classes of components with identical structures. By utilizing such symmetry, for specifications irrelevant to the detailed component information, the supervisory control of SDES can be achieved in the relabeled level. Namely, for events fulfilling the same task (similar events) in a class of components, they are relabeled to the same symbol. The relabeling mechanism is first implemented by directly renaming similar events to the same symbol. Then by employing the subset construction algorithm (SCA), the resultant nondeterministic automaton is converted to its deterministic counterpart. As the SCA is computationally intensive, the relabeling algorithm is inefficient, especially when the number of components increases. In this paper, inspired by the construction process of quotient automata, we first employ symmetry to generate the state set of the relabeled automaton. Then the relabeled automaton is generated based on the generated state set and transition information among these states. As we avoid using the SCA to eliminate nondeterminism, the relabeling process is more efficient. A running example is given throughout the paper.

show abstract

On coparanormality in distributed supervisory control of discrete‐event systems

Cited by 2 publications

References 29 publications

Event Reduction in Localization of DES Supervisory Control

Event Reduction in Localization of DES Supervisory Control

On efficient relabeling of symmetric discrete‐event systems

Contact Info

Product

Resources

About