2019 IEEE 58th Conference on Decision and Control (CDC) 2019
DOI: 10.1109/cdc40024.2019.9029888
|View full text |Cite
|
Sign up to set email alerts
|

Supervisor Synthesis for Networked Discrete Event Systems With Communication Delays and Lossy Channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 36 publications
(31 citation statements)
references
References 12 publications
0
31
0
Order By: Relevance
“…As in [17], [21], [23], this paper assumes that i) both the control channel and the observation channel satisfy first-infirst-out (FIFO); ii) the observation delays and the control delays are upper bounded by N o and N c event occurrences (observable or not), respectively; iii) the numbers of consecutive observation losses and consecutive control losses are no larger than N l,o and N l,c , respectively. This paper answers the following two questions.…”
Section: Introductionmentioning
confidence: 89%
See 1 more Smart Citation
“…As in [17], [21], [23], this paper assumes that i) both the control channel and the observation channel satisfy first-infirst-out (FIFO); ii) the observation delays and the control delays are upper bounded by N o and N c event occurrences (observable or not), respectively; iii) the numbers of consecutive observation losses and consecutive control losses are no larger than N l,o and N l,c , respectively. This paper answers the following two questions.…”
Section: Introductionmentioning
confidence: 89%
“…Besides, since the communication losses are usual small, we also assume that both the consecutive observation losses and the consecutive control losses are with upper bounds. The same assumption can be found in [21]. Meanwhile, the delays are measured by the number of event occurrences (observable or not).…”
Section: Preliminariesmentioning
confidence: 95%
“…For each σ ∈ Σ o , each 0 ≤ i ≤ num o and each k ≥ 0, let ((m σ , i), k) denote the multi-set that consists of k copies of (m σ , i). We define |((m σ , i), k)| = k, obs ∪Σ out obs ∪{tick})×Q obs can be defined, in a way that is similar to the partial transition function of [16] for FIFO observation channels. The observation channel automaton is then given by G obs = (Q obs , Σ in obs ∪ Σ out obs ∪ {tick}, δ obs , q {} ), where q {} ∈ Q obs is the initial state that corresponds to the empty observation channel.…”
Section: A Automata For the Observation Channel And Control Channelmentioning
confidence: 99%
“…be formulated and fit into the generalized framework for networked systems. The synthesis problem under FIFO assumption of the communication channels has been discussed in [16]; Finally, it can be extended to other control architectures naturally, e.g., distributed, hierarchical and decentralized networked supervisory control.…”
Section: Case Studymentioning
confidence: 99%
See 1 more Smart Citation