activity
20142023
most citedObservability of Boolean control networks: A unified approach based on the theories of finite automata

175 citations · 192 across the 19 of their papers we have counts for

collaborators

19 papers

eess.SY2023★ 1 cited

Structures of M-Invariant Dual Subspaces with Respect to a Boolean Network

Dongyao Bi, Lijun Zhang, Kuize Zhang +1

This paper presents the following research findings on Boolean networks (BNs) and their dual subspaces.First, we establish a bijection between the dual subspaces of a BN and the pa…

cs.CR2022

Verification of Strong K-Step Opacity for Discrete-Event Systems

Xiaoguang Han, Kuize Zhang, Zhiwu Li

In this paper, we revisit the verification of strong K-step opacity (K-SSO) for partially-observed discrete-event systems modeled as nondeterministic finite-state automata. As a st…

eess.SY2021

A unified concurrent-composition method to state/event inference and concealment in discrete-event systems

Kuize Zhang

Discrete-event systems usually consist of discrete states and transitions between them caused by spontaneous occurrences of labelled (aka partially-observed) events. Due to the par…

math.OC2021

New methods for verifying strong periodic detectability and strong periodic D-detectability of discrete-event systems

Kuize Zhang

In this paper, in discrete-event systems modeled by finite-state automata (FSAs), we show new thinking on the tools of detector and concurrent composition and derive two new algori…

cs.CR2021

Strong current-state and initial-state opacity of discrete-event systems

Xiaoguang Han, Kuize Zhang, Jiahui Zhang +2

Opacity, as an important property in information-flow security, characterizes the ability of a system to keep some secret information from an intruder. In discrete-event systems, b…

cs.FL2021

Diagnosability of labeled automata

Kuize Zhang, Joerg Raisch

In this paper, we formulate a notion of diagnosability for labeled weighted automata over a class of dioids which admit both positive and negative numbers as well as vectors. The w…

eess.SY2020★ 1 cited

A Framework for Output-Feedback Symbolic Control

Mahmoud Khaled, Kuize Zhang, Majid Zamani

Symbolic control is an abstraction-based controller synthesis approach that provides, algorithmically, certifiable-by-construction controllers for cyber-physical systems. Symbolic…

cs.FL2020

Detectability of labeled weighted automata over monoids

Kuize Zhang

In this paper, we for the first time obtain characterization of four fundamental notions of detectability for general labeled weighted automata over monoids (denoted by $\mathcal{A…

math.OC2020

A unified method to decentralized state inference and fault diagnosis/prediction of discrete-event systems

Kuize Zhang

The state inference problem and fault diagnosis/prediction problem are fundamental topics in many areas. In this paper, we consider discrete-event systems (DESs) modeled by finite-…

math.OC2019★ 4 cited

Revisiting delayed strong detectability of discrete-event systems

Kuize Zhang, Alessandro Giua

Among notions of detectability for a discrete-event system (DES), strong detectability implies that after a finite number of observations to every output/label sequence generated b…

math.OC2019

Synthesis for observability of logical control networks

Kuize Zhang

Finite-state systems have applications in systems biology, formal verification and synthesis of infinite-state (hybrid) systems, etc. As deterministic finite-state systems, logical…

math.OC2018★ 3 cited

On detectability of labeled Petri nets and finite automata

Kuize Zhang, Alessandro Giua

We study detectability properties for labeled Petri nets and finite automata. We first study weak approximate detectability (WAD) that implies that there exists an infinite observe…

cs.LO2018★ 2 cited

Opacity of nondeterministic transition systems: A (bi)simulation relation approach

Kuize Zhang, Xiang Yin, Majid Zamani

In this paper, we propose several opacity-preserving (bi)simulation relations for general nondeterministic transition systems (NTS) in terms of initial-state opacity, current-state…

math.OC2017★ 1 cited

Observability and reconstructibility of large-scale Boolean control networks via network aggregations

Kuize Zhang

It is known that determining the observability and reconstructibility of Boolean control networks (BCNs) are both NP-hard in the number of nodes of BCNs. In this paper, we use the…

math.OC2016★ 1 cited

Basis for the linear space of matrices under equivalence

Kuize Zhang

The semi-tensor product (STP) of matrices which was proposed by Daizhan Cheng in 2001 [2], is a natural generalization of the standard matrix product and well defined at every two…

math.OC2015

Polynomial representation for orthogonal projections onto subspaces of finite games

Kuize Zhang

The space of finite games can be decomposed into three orthogonal subspaces [5], which are the subspaces of pure potential games, nonstrategic games and pure harmonic games. The or…

math.OC2015★ 1 cited

A weighted pair graph representation for reconstructibility of Boolean control networks

Kuize Zhang, Lijun Zhang, Rong Su

A new concept of weighted pair graphs (WPGs) is proposed to represent a new reconstructibility definition for Boolean control networks (BCNs), which is a generalization of the reco…

math.OC2014★ 175 cited

Observability of Boolean control networks: A unified approach based on the theories of finite automata

Kuize Zhang, Lijun Zhang

The problem on how to determine the observability of Boolean control networks (BCNs) has been open for five years already. In this paper, we propose a unified approach to determine…

math.OC2014★ 3 cited

High-order S-Lemma with application to stability of a class of switched nonlinear systems

Kuize Zhang, Lijun Zhang, Fuchun Sun

This paper extends some results on the S-Lemma proposed by Yakubovich and uses the improved results to investigate the asymptotic stability of a class of switched nonlinear systems…