activity
20182022
most citedRevisiting delayed strong detectability of discrete-event systems

4 citations · 4 across the 5 of their papers we have counts for

collaborators

7 papers

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…

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…

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.OC20194 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.OC2018

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…