Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
121
0
8

Year Published

2009
2009
2020
2020

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 159 publications
(131 citation statements)
references
References 10 publications
2
121
0
8
Order By: Relevance
“…control covers). The minimal state problem, however, is known to be NP-hard [11]. In [3] we proposed, nevertheless, a polynomial-time localization algorithm which computes congruences instead of covers; and empirical evidence was given that significant state size reduction can often be achieved.…”
Section: Theoremmentioning
confidence: 99%
“…control covers). The minimal state problem, however, is known to be NP-hard [11]. In [3] we proposed, nevertheless, a polynomial-time localization algorithm which computes congruences instead of covers; and empirical evidence was given that significant state size reduction can often be achieved.…”
Section: Theoremmentioning
confidence: 99%
“…We solve ( ) by developing a supervisor localization procedure, essentially a straightforward extension of supervisor reduction [56,53].…”
Section: Supervisor Localizationmentioning
confidence: 99%
“…Fix an element k ∈ K. Following [53], we first establish a control cover on X, the state space of SUP, based only on control information pertaining to Σ k c , as captured by the following four functions. First define E : X → P wr(Σ) according to…”
Section: Supervisor Localizationmentioning
confidence: 99%
See 2 more Smart Citations