Finite Bisimulations for Switched Linear Systems

Download

index.pdf

Date

2014-12-01

Author

Aydın Göl, Ebru
Lazar, Mircea
Belta, Calin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

256
views

162
downloads

In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interior, the proposed algorithm iteratively constructs the bisimulation quotient for the region bounded by any larger sublevel set. We show how this bisimulation quotient can be used for synthesis of switching laws and verification with respect to specifications given as syntactically co-safe Linear Temporal Logic formulae over the observed polytopic subsets.

Subject Keywords

Abstractions, Formal methods, Switched systems

URI

https://hdl.handle.net/11511/46021

Journal

IEEE TRANSACTIONS ON AUTOMATIC CONTROL

DOI

https://doi.org/10.1109/tac.2014.2351653

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Finite bisimulations for switched linear systems Aydın Göl, Ebru; Lazar, Mircea; Belta, Calin (2013-02-04) In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interio...
Almost periodic solutions of the linear differential equation with piecewise constant argument Akhmet, Marat (2009-10-01) The paper is concerned with the existence and stability of almost periodic solutions of linear systems with piecewise constant argument where t∈R, x ∈ Rn [·] is the greatest integer function. The Wexler inequality [1]-[4] for the Cauchy's matrix is used. The results can be easily extended for the quasilinear case. A new technique of investigation of equations with piecewise argument, based on an integral representation formula, is proposed. Copyright © 2009 Watam Press.
Characterisation and enumeration of a class of semi bent quadratic Boolean functions KOÇAK, Neşe; Koçak, Onur Ozan; Özbudak, Ferruh; SAYGI, ZÜLFÜKAR (2015-01-01) In this paper, we consider semi-bentness of quadratic Boolean functions defined for even n and give the characterisation of these functions. Up to our knowledge, semi-bentness of this class has not been investigated before and we proved that semi-bent functions of this form exist only for 6|n. Furthermore, we present a method for enumeration of semi-bent and bent functions in certain classes. Using this method we find the exact number of semi-bent functions of this form. Moreover, we complete some previous ...
FINITE DIFFERENCE APPROXIMATIONS OF VARIOUS STEKLOV EIGENVALUE PROBLEMS ÖZALP, MÜCAHİT; Bozkaya, Canan; Türk, Önder; Department of Mathematics (2022-8-26) In this thesis, the finite difference method (FDM) is employed to numerically solve differently defined Steklov eigenvalue problems (EVPs) that are characterized by the existence of a spectral parameter on the whole or a part of the domain boundary. The FDM approximation of the Laplace EVP is also considered due to the fact that the defining differential operator in a Steklov EVP is the Laplace operator. The fundamentals of FDM are covered and their applications on some BVPs involving Laplace operator are d...
On plateaued functions, linear structures and permutation polynomials Mesnager, Sihem; Kaytancı, Kübra; Özbudak, Ferruh (2019-01-01) We obtain concrete upper bounds on the algebraic immunity of a class of highly nonlinear plateaued functions without linear structures than the one was given recently in 2017, Cusick. Moreover, we extend Cusick’s class to a much bigger explicit class and we show that our class has better algebraic immunity by an explicit example. We also give a new notion of linear translator, which includes the Frobenius linear translator given in 2018, Cepak, Pasalic and Muratović-Ribić as a special case. We find some app...

Citation Formats

E. Aydın Göl, M. Lazar, and C. Belta, “Finite Bisimulations for Switched Linear Systems,” IEEE TRANSACTIONS ON AUTOMATIC CONTROL, pp. 3122–3134, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46021.