Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

We introduce a statistical model for times series data with nonlinear dynamics which iteratively segments the data into regimes with approximately linear dynamics and learns the parameters of each of those regimes. This model combines and generalizes two of the most widely used stochastic time series models|the hidden Markov model and the linear dynamical system|and is related to models that ar...

Structured approaches based on Kronecker operators for the description and solution of the infinitesimal generator of a continuous-time Markov chains are receiving increasing interest. However, their main advantage, a substantial reduction in the memory requirements during the numerical solution, comes at a price. Methods based on the “potential state space” allocate a probability vector that m...

— This paper is devoted to the introduction and analysis of regularization in state space for nonlinear illposed inverse problems. Applications to parameter estimation problems are given and numerical experiments are described. Résumé. — Nous introduisons et analysons la régularisation dans l'espace d'état pour les problèmes inverses non linéaires. Nous donnons des applications aux problèmes d'...

Neural networks are applicable in identification systems from input-output data. In this report, we analyze theHammerstein-Wiener models and identify them. TheHammerstein-Wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two static nonlinear blocks, whichappear in many engineering applications; the aim of nonlinearsyst...

The vulnerability and importance of computers, robots, internet etc, demand the employment of exceedingly reliable security protocols. E-Business can not be encouraged with susceptible underlying security protocols. We present a heuristic state space search model for automatic security protocol verification. Our model exploits its knowledge of the search space and intelligently enhances the eff...

In this paper we consider the problem of constructing a well-posed state space model for a class of singular integro-diierential equations of neutral type. The work is motivated by the need to develop a framework for the analysis of numerical methods for designing control laws for aeroelastic and other uid/structure systems. Semigroup theory is used to establish existence and well-posedness res...

| Optical ow estimators of motion in image sequences are sometimes found using varia-tional frameworks, which produce partial diierential equations as the estimators. In this paper, we show that certain state-space formulations, solved by linear smoothing theory, lead to these same solutions. The advantages of viewing these problems in this way include explicit stochastic motion models, a prior...

Analysis of the asymptotic properties of the MOESP type of subspace algorithms Abstract The MOESP type of subspace algorithms are used for the identiication of linear, discrete time, nite dimensional state space systems. They are based on the geometric structure of covariance matrices and exploit the properties of the state vector extensively. In this paper the asymptotic properties of the algo...