1,721,034 research outputs found
On the structure of positive behaviours
No full textPositive systems in the behavioural approach are introduced as sets of non-negative trajectories that satisfy a closure condition with respect to linear combinations witn non-negative coefficients. Completeness and finite menory are discussed and compared with the analogous properties of linear shift invariant behaviours
The dominant global state in the asymptotic analysis of 2D systems
No full textThe dominant state plays an essential role in the asymptotic analysis of dynamical systems. As
global states of a 2D system are bilateral sequences, the existence of a dominant state implies that
the free evolution of 2D global states converges to a suitable sequence, up to the multiplication by
a normalizing factor. In this contribution the existence of a dominant state is analysed under the
assumption that the initial global state is the Fourier Stieltjes transform of a bounded variation
function
BILATERAL CONVOLUTIONAL CODES OVER A FINITE FIELD
No full textIn this communication we introduce convolutional codes constituted by bilateral sequences over a finite field and analyze the structure of their encoders
Code Decomposition in the Analysis of a Convolutional Code
No full textA convolutional code can be decomposed into smaller codes if it admits decoupled encoders. In this paper, we show that if a code can be decomposed into smaller codes (subcodes) its column distances are the minimum of the column distances of its subcodes. Moreover, the j-th column distance of a convolutional code C is equal to the j-th column distance of the convolutional codes generated by the truncation of the canonical encoders of C to matrices which entries have degree smaller or equal than j. We show that if one of such codes can be decomposed into smaller codes, so can be all the other codes
Fault detection problems for Boolean networks and Boolean control networks
No full textIn this paper we address two fault detection problems for Boolean control networks (BCNs). We assume that the BCN may exhibit only two possible configurations, a non-faulty and a faulty one. The fault is simply described as the switching from the non-faulty configuration to the faulty one, and we assume that the BCN cannot autonomously recover from the fault, unless some external intervention restores the regular working conditions. Finally, we suppose that the fault affects only the stateupdate, not the output measurements. In this set-up, we introduce the concepts of meaningful fault and of detectable meaningful fault. Two different situations are investigated: the case when fault detection must be performed on-line, under arbitrary working conditions, and hence corresponding to arbitrary inputs acting on the BCN, and the case when an off-line test is performed, by making use of a specific input, in order to test whether the BCN is non-faulty or faulty. Complete characterizations and an algorithm to practically perform the tests in both cases are presented. The obtained results for on-line fault detection are finally particularized to the special case of Boolean networks (BNs)
La memoria della materia, la materia della memoria
No full textThe first part of the paper is devoted to the analysis of dynamical systems performance. Specifically, in these systems the effects of past inputs on the present state may be regarded as a form of memory (whereas a static system can be considered as memoryless). The second part of the paper describes the standard storage devices adopted in the field of computer technology as well as other storing devices for recording words, sounds and images
Stability and stabilizability of 2D behaviorsProceedings of the 36th IEEE Conference on Decision and Control
No full textOptimal control of Boolean control networks
No full textIn this paper, we address the optimal control problem for Boolean control networks (BCNs). We first consider the problem of finding the input sequences that minimize a given cost function over a finite time horizon. The problem solution is obtained by means of a recursive algorithm that represents the analogue for BCNs of the difference Riccati equation for linear systems. We prove that a significant number of optimal control problems for BCNs can be easily reframed into the present setup. In particular, the cost function can be adjusted so as to include penalties on the switchings, provided that we augment the size of the BCN state variable. In the second part of the paper, we address the infinite horizon optimal control problem and we provide necessary and sufficient conditions for the problem solvability. The solution is obtained as the limit of the solution over the finite horizon , and it is always achieved in a finite number of steps. Finally, the average cost problem over the infinite horizon, investigated in “Optimal control of logical control networks” (Y. Zhao , IEEE Trans. Autom. Control, vol 56, no. 8, pp. 1766–1776, Aug. 2011), is addressed by making use of the results obtained in the previous sections
- …
