Proper elimination of latent variables

We consider behaviors in which we distinguish two types of variables, manifest variables, the variables that are of interest to the user and latent variables, the variables that are introduced to obtain a first representation. The problem is to find a representation of the manifest behavior, that is, we want to eliminate the latent variables. If the original behavior can be represented by linear differential equations with constant coefficients, then under certain conditions the same is true for the manifest behavior. In this note we formulate and study these conditions. The results are illustrated by means of some examples. As an application we study behaviors in image representation

Tools for Stability of Switching Linear Systems: Gain Automata and Delay Compensation.

The topic of this paper is the analysis of stability for a class of switched linear systems, modeled by hybrid automata. In each location of the hybrid automaton the dynamics is assumed to be linear and asymptotically stable; the guards on the transitions are hyperplanes in the state space. For each location an estimate is made of the gain via a Lyapunov function for the dynamics in that location, given a pair of ingoing and outgoing transitions. It is shown how to obtain the best possible estimate by optimizing the Lyapunov function. The estimated gains are used in defining a so-called gain automaton that forms the basis of an algorithmic criterion for the stability of the hybrid automaton. The associated gain automaton provides a systematic tool to detect potential sources of instability as well as an indication on to how to stabilize the hybrid systems by requiring appropriate delays for specific transitions

On the possible divergence of the projection algorithm

By means of an example, the authors show that the sequence of estimates generated by the projection algorithm does not always converge. The authors' construction shows that convergence is not automatically among the properties that can be derived without additional assumptions on the input sequenc

Reed-Solomon list decoding from a system-theoretic perspective

In this paper, the Sudan-Guruswami approach to list decoding of Reed-Solomon (RS) codes is cast in a system-theoretic framework. With the data, a set of trajectories or time series is associated which is then modeled as a so-called behavior. In this way, a connection is made with the behavioral approach to system theory. It is shown how a polynomial representation of the modeling behavior gives rise to the bivariate interpolating polynomials of the Sudan-Guruswami approach. The concept of "weighted row reduced" is introduced and used to achieve minimality. Two decoding methods are derived and a parametrization of all bivariate interpolating polynomials is given

Correction and simplification to "The order of a stabilizing regulator is sufficient a priori information for adaptive stabilization

This note corrects a mistake in a paper by Mårtensson (1986). The main conclusion there (as reflected in the title) remains unchanged, only the construction of the `universal controller¿ has to be carried out slightly differently

Re-verification of a Lip Synchronization Algorithm using robust reachability

The timed automata formalism is an important model for specifying and analysing real-time systems. Robustness is the correctness of the model in the presence of small drifts on clocks or imprecision in testing guards. A symbolic algorithm for the analysis of the robustness of timed automata has been implemented. In this paper we re-analyse an industrial case lip synchronization protocol using the new robust reachability algorithm.This lip synchronization protocol is an interesting case because timing aspect are crucial for the correctness of the protocol. Several versions of the model are considered, with an ideal video stream, with anchored jitter, and with non-anchored jitter

Adaptive poleplacement: the division by zero problem

We re-examine the division by zero problem which occurs in certainty equivalence based indirect adaptive control algorithms applied to linear systems. By exploiting a parametrization for linear systems induced by the continued fraction description of its transfer function, the division by zero problem obtains a very simple geometric representation that can be used to virtually eliminate the problem in the adaptive algorith

Stability criteria for planar linear systems with state reset

In this work we perform a stability analysis for a class of switched linear systems, modeled as hybrid automata. We deal with a switched linear planar system, modeled by a hybrid automaton with one discrete state. We assume the guard on the transition is a line in the state space and the reset map is a linear projection onto the x-axis. We define necessary and sufficient conditions for stability of the switched linear system with fixed and arbitrary dynamics in the location. \u