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

Bisimilarity Enforcement for Discrete Event Systems Using Deterministic Control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
17
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 23 publications
(17 citation statements)
references
References 11 publications
0
17
0
Order By: Relevance
“…Firstly, we introduce the following two notions for finite automata, which have been presented in [37], [6].…”
Section: A Fuzzy Simulation and Fuzzy Simulation Equivalencementioning
confidence: 99%
“…Firstly, we introduce the following two notions for finite automata, which have been presented in [37], [6].…”
Section: A Fuzzy Simulation and Fuzzy Simulation Equivalencementioning
confidence: 99%
“…Various supervisory control problems for nondeterministic systems were studied in [2]- [10]. In particular, a general case that both the plant and the specification are nondeterministic, and a supervisor is allowed to be nondeterministic was considered in [2], [9].…”
Section: Introductionmentioning
confidence: 99%
“…The small model theorem was generalized to the setting of partial event observation in [12]. To reduce the computational complexity for verifying the existence of a supervisor, a special case that a supervisor is deterministic was considered in [10]. It was shown that, in this special case, the complexity for verifying the existence of a bisimilarity enforcing deterministic supervisor is linear in the size of the plant and singly exponential in the size of the specification.…”
Section: Introductionmentioning
confidence: 99%
“…In both these works, the existence of a bisimilarity supervisor depends on the existence of a state controllable automaton, which is hard to calculate in a systematic way, and the complexity of checking the existence condition is doubly exponential. To reduce the computational complexity, Zhou & Kumar (2011) specialized to deterministic supervisors. The existence condition for a deterministic bisimilarity supervisor considering nondeterministic plants and nondeterministic specifications was identified.…”
Section: Introductionmentioning
confidence: 99%
“…First, a novel notion of synchronous simulation-based controllability is introduced as a necessary and sufficient condition for the existence of a bisimilarity enforcing supervisor. Although it is equivalent to the conditions in (Zhou & Kumar, 2011) specialized to deterministic specifications, it provides a great insight into what characters should a deterministic specification possesses for bisimilarity control. Second, a test algorithm is proposed to verify the existence condition, which is shown to be polynomial complexity (less than the complexity of the conditions in (Zhou & Kumar, 2011)).…”
Section: Introductionmentioning
confidence: 99%