2008
DOI: 10.1109/tac.2007.914234
|View full text |Cite
|
Sign up to set email alerts
|

Decentralized Control of Discrete-Event Systems When Supervisors Observe Particular Event Occurrences

Abstract: Abstract-Work on decentralized discrete-event control systems is extended to handle the case when, instead of always observing or never observing an event, a supervisor may observe only some occurrences of a particular event. Results include a necessary and sufficient condition for solving this version of the decentralized problem (which is analogous to the co-observability property used in the standard version of the problem) and a method for checking when this condition holds. In this paper, whether an event… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
15
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 19 publications
(15 citation statements)
references
References 7 publications
(5 reference statements)
0
15
0
Order By: Relevance
“…The dynamic versions of the properties of observability and coobservability also have been considered in [24] in the context of sensor activation. Polynomial testing methods for transition-based dynamic observations are developed in [34] for observability and in [35] for coobservability of two-agent systems.…”
Section: Introductionmentioning
confidence: 99%
“…The dynamic versions of the properties of observability and coobservability also have been considered in [24] in the context of sensor activation. Polynomial testing methods for transition-based dynamic observations are developed in [34] for observability and in [35] for coobservability of two-agent systems.…”
Section: Introductionmentioning
confidence: 99%
“…For instance, Ref. Huang et al (2008) presents a verification algorithm of complexity of O(|X | 6 |E|) for transition-based coobservability with two agents (|X | is the number of states and |E| is the number of events of the system); however, the extension of this algorithm to the case of n agents is not available in the literature (Sears & Rudie, 2015). However, by applying the transformation algorithm in Wang et al (2011) and the verification algorithm in Section 4, the verification of transition-based coobservability can be…”
Section: Discussion and Summary Of Resultsmentioning
confidence: 99%
“…|E| 2 ), which may improve the computational complexity over the algorithm in Huang et al (2008), since |E| is usually much smaller than |X|. Moreover, this approach is applicable to the case of n agents.…”
Section: Discussion and Summary Of Resultsmentioning
confidence: 99%
See 2 more Smart Citations