On the regular implementability of nD systems

Trentelman, Harry L.; Napp, Diego

doi:10.1016/j.sysconle.2006.10.017

Cited by 21 publications

(35 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This condition is equivalent to: C does not re-impose restriction on K full (C) that are already present in P full (see [6] and [7]). …”

Section: Formulationmentioning

confidence: 99%

“…In the sequel, the interconnected behavior L full (K) = P full ∧ w K plays an important role, which is summarized in the following proposition obtained in [6] (see also [7]). …”

Section: B Partial Interconnectionmentioning

confidence: 99%

“…Then K ∈ L q is regularly implementable by partial interconnection through c with respect to P full if and only if the following two conditions hold: 1) K is implementable, 2) (L full (K)) c is regularly implementable by full interconnection with respect to (P full ) c . From [6] and [7], if C regularly implements K by partial interconnection, then C ′ = C + {c | (0, c) ∈ P full } regularly implements (L full (K)) c with respect to (P full ) c , and C ′ also regularly implements K by partial interconnection through c with respect to P full .…”

Section: B Partial Interconnectionmentioning

confidence: 99%

“…From [6] and [7] the same C regularly implements K by partial interconnection (through c with respect to P full ).…”

Section: B Partial Interconnectionmentioning

confidence: 99%

“…From [6] and [7] if C regularly implements K then C ′ = C + {c | (0, c) ∈ P full } regularly implements (L full (K)) c with respect to (P full ) c . Let C = C 1 C 2 and…”

Section: B Partial Interconnectionmentioning

confidence: 99%

See 4 more Smart Citations

On regular implementability using controllers with a priori input/output structure

Trentelman

Fiaz

2007

2007 46th IEEE Conference on Decision and Control

Self Cite

View full text Add to dashboard Cite

“…This condition is equivalent to: C does not re-impose restriction on K full (C) that are already present in P full (see [6] and [7]). …”

Section: Formulationmentioning

confidence: 99%

“…In the sequel, the interconnected behavior L full (K) = P full ∧ w K plays an important role, which is summarized in the following proposition obtained in [6] (see also [7]). …”

Section: B Partial Interconnectionmentioning

confidence: 99%

Section: B Partial Interconnectionmentioning

confidence: 99%

“…From [6] and [7] the same C regularly implements K by partial interconnection (through c with respect to P full ).…”

Section: B Partial Interconnectionmentioning

confidence: 99%

“…From [6] and [7] if C regularly implements K then C ′ = C + {c | (0, c) ∈ P full } regularly implements (L full (K)) c with respect to (P full ) c . Let C = C 1 C 2 and…”

Section: B Partial Interconnectionmentioning

confidence: 99%

See 3 more Smart Citations

On regular implementability using controllers with a priori input/output structure

Trentelman

Fiaz

2007

2007 46th IEEE Conference on Decision and Control

Self Cite

View full text Add to dashboard Cite

Strongly autonomous interconnections and stabilization of 2D behaviors

Napp

Rocha

2010

Asian Journal of Control

View full text Add to dashboard Cite

In this paper we study linear discrete two-dimensional systems in the behavioral context where control is viewed as interconnection. Within this framework the natural concept of regular interconnection has been introduced by J.C.Willems. Here we investigate regular interconnections that yield finite dimensional behaviors using tools previously developed to analyze almost implementation problems. We prove that when a finite dimensional (sub-) behavior can be achieved from a given behavior by regular interconnection then the controllable part of the original behavior is rectifiable, moreover, in this case all the other sub-behaviors are almost regularly implementable. We apply these results to characterize all stabilizable behaviors.

show abstract