Learn More
— In this paper we study switched systems from a behavioral point of view. We define a switched behavioral system in terms of a bank of behaviors without referring to the notion of state. Moreover we give sufficient conditions for the stability of a switched behavior in terms of the behaviors in the underlying bank. I. INTRODUCTION Classical switched(More)
In this short paper we study the problem of finding necessary and sufficient conditions for regular implementability by partial interconnection for nD system behaviors. In [3] such conditions were obtained in the context of 1D systems. In the present paper we show that the conditions obtained in [3] are no longer valid in general in the nD context. We also(More)
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t We consider autonomous n-dimensional systems over Z n with different(More)
In this paper we investigate a Lyapunov approach to the stability of nite-dimensional 2D systems. We use the behavioral framework and consider a notion of stability following the ideas in (15, 18, 19). We characterize stability in terms of the existence of a (quadratic) Lyapunov function and provide a constructive algorithm for the computation of all such(More)
In this paper we present an efficient approach to the analysis of discrete positive singular systems. One of our main objectives is to investigate the problem of characterizing positivity of such systems. Previously, this issue was not completely addressed. We provide easily checkable necessary and sufficient conditions for such problem to be solved. On the(More)
Two-dimensional convolutional codes are considered with code sequences having compact support indexed in N2 and taking values in Fn , where F is a finite field. Input-state-output representations of these codes are introduced and several aspects of such representations are discussed. Constructions of such codes with a designed distance are also presented.