Abstract
In this paper, the gas dynamics within the pipelines is modelled as a repetitive process with smoothing. Controllability and observability criteria when the system is steered through initial and boundary data, which is achieved by an adequate choice of the homogeneity, are obtained. From the point of view of the technical applications, it seems to make more sense to consider boundary data controls as for instance in the management of high pressure gas networks. Stability criteria suitable computer simulations are also included.

Abstract
In this paper, the gas dynamics within the pipelines is written as a wave repetitive process, and modify it in a way that the dynamics is influenced by p decision makers, namely the boundary conditions. We obtain sufficient criteria for the existence of boundary equilibrium controls as well as controllability of the different agents and observability of the system when this is steered through initial and boundary data. From the point of view of some applications it seems to make sense to consider boundary data controls, e.g. in high pressure gas networks management.

Abstract
In this paper, we proffer an explicit representation of solutions for a specific class of linear repetitive processes with smoothing. This representation is used to obtain direct controllability and observability criteria of this same class of discrete time 2-D systems. Not only classical controllability properties are considered, where control of the system is obtained by choosing its inhomogeneity appropriately, but also controllability of the system by steering it through boundary data control. From the point of view of technical applications, for instance in high pressure gas network modelling (see Azevedo-PerdicoA(0)lis and Jank in Proceedings of n-DS, international workshop on multidimensional systems, Thessaloniki. 2009), it seems to be more reliable to consider boundary data controls. Therefore, in this paper we emphasise boundary data control properties of the system. A disturbed optimal boundary control problem with a quadratic criterion is also solved.

Abstract
System Identification (SI) is a methodology for building mathematical models of dynamic systems from experimental data, i.e., using measurements of the system input/output (IO) signals to estimate the values of adjustable parameters in a given model structure. The process of SI requires some steps, such as measurement of the IO signals of the system in time or frequency domain, selection of a candidate model structure, choice and application of a method to estimate the value of the adjustable parameters in the candidate model structure, validation and evaluation of the estimated model to see if the model is right for the application needs, which should be done preferably with a different set of data, [PS] and [Lj1]. © 2015 Springer International Publishing.

Abstract
In this paper we introduce a recursive subspace system identification algorithm for MIMO linear parameter varying systems driven by general inputs and a white noise time varying parameter vector. The new algorithm is based on a convergent sequence of linear deterministic-stochastic state-space approximations, thus considered a Picard based method. Such methods have proven to be convergent for the bilinear state-space system identification problem. The key to the proposed algorithm is the fact that the bilinear term between the time varying parameter vector and the state vector behaves like a white noise process. Using a linear Kalman filter model, the bilinear term can be efficiently estimated and then used to construct an augmented input vector at each iteration. Since the previous state is known at each iteration, the system becomes linear, which can be identified with a linear-deterministic subspace algorithm such as MOESP, N4SID, or CVA. Furthermore, the model parameters obtained with the new algorithm converge to those of a linear parameter varying model. Finally, the dimensions of the data matrices are comparable to those of a linear subspace algorithm, thus avoiding the curse of dimensionality. © 2007 EUCA.

Abstract