This paper presents a tool for symbolic analysis of electronic circuits – continuous-time circuits and periodically switched linear (PSL) circuits. Applied method of analysis is based on modeling of periodically switched networks by mixed s, z description. The method is implemented in program MapleTM in the form of Maple package named PraSCAn. Current version of the package provides all basic a...

In this paper, we study the problem of verifying dynamic coverage in mobile sensor networks using certain switched linear systems. These switched systems describe the flow of discrete differential forms on time-evolving simplicial complexes. The simplicial complexes model the connectivity of agents in the network, and the homology groups of the simplicial complexes provides information about th...

In this paper, the switched generalized neural networks with mixed time-varying delays are proposed. Based on the strictly complete property of the matrices system, a switching rule which depends on the state of the network is designed. By employing a novel Lyapunov-Krasovskii functional, a delaydependent criterion is achieved in terms of Linear matrix inequalities (LMIs) which guarantees the e...

This article studies the constrained switching (linear) system which is a discrete-time switched linear whose sequences are by deterministic finite automaton. The stability of characterized its joint spectral radius that known to be difficult compute or approximate. Using semitensor product matrices, matrix-form expression shown equivalent lifted arbitrary system. Then, joint/generalized proven...

Stability problem for a class of linear continuous time and discrete time systems is well understood since long. This analysis has also been extended to switched linear systems with continuous and discrete descriptions. For such cases, arbitrary switching problem is addressed by constructing common quadratic and non-quadratic Lyapunov function. Moreover, keeping in view the invertible time dela...