\documentclass[12pt]{article}
\begin{document}
%Carriegos
%Miguel","miguel.carriegos@unileon.es","
\section{Reachability of regular switched linear systems} By {\sl Miguel V. Carriegos}.  

\medskip  \noindent Switched linear systems belong to a special class of hybrid control systems which comprises a collection of subsystems described by linear dynamics (differential/difference equations) together with a switching rule that specifies the switching between the subsystems. Such systems can be used to describe a wide range of physical and engineering problems in practice. On the other hand, switched linear systems have been attracting much attention in the recent past years because of the arising problems are not only academically challenging but also of practical importance.  In this talk we consider \emph{regular switched sequential linear systems}; that is, sequential switched linear systems $$\Gamma:\underline{x}(t+1)=A_{\sigma(t)}\underline{x}(t)+B_{\sigma(t)}\underline{u}(t)$$ where the switching signals $\sigma(0)\sigma(1)\sigma(2)... \in \Sigma^{\ast}$ belong to a regular language $L_{\Gamma}\subseteq\Sigma^{\ast}$ of admissible sequences of commands of system $\Gamma$. This is actually equivalent to saying that switching signals are governed by a finite automaton.  We study the notion of reachability in terms of families of matrices $A_{\sigma(-)}$ and $B_{\sigma(-)}$ by using linear algebra techniques.
%hybrid system; local automaton; controllability","93B25","68A25","","06:44:57","Thu Mar 06 2008","193.146.100.244"
%\documentclass[12pt]{article}
%\usepackage{amsmath}
%\usepackage{amsthm}
%\usepackage{amssymb}
%\usepackage{amsfonts}
%\newtheorem{theorem}{Theorem}[section]
%\newtheorem{corollary}{Corollary}[section]
%\def\Z{\mathbb Z}
%\def\rank{\hbox{\rm \ rank}}
%\begin{document}

\end{document}
 zzzz
