Speaker: Kuize Zhang, lecturer, University of Surrey, UK

Date: December 13, 2022

Time: 19:00-20:00

Location: Tencent Meeting

Sponsor: School of Mathematics, Shandong University

Abstract:

Detectability of partially-observed dynamical systems is a basic property which means that one can use observed output sequences to determine the current and subsequent states. The state detection problem dates back to E. F. Moore’s Gedanken-experiments in 1956 on sequential machines which were called Moore machines later. The basic definitions of strong detectability and weak detectability in discrete-event systems modeled by labeled finite-state automata were given by Shu and Lin in 2007. In this talk, we will firstly review the classical polynomial-time verification algorithm for strong detectability of labeled finite-state automata given by S. Shu and F. Lin in 2011 based on two fundamental assumptions of (1) deadlock-freeness (an automaton will always run) and (2) having no reachable unobservable cycle (the running of an automaton will eventually be observed). Shu and Lin’s algorithm was derived based on their detector method. Secondly, we will introduce our new polynomial-time verification algorithm (collaboration with A. Giua) by developing a concurrent-composition method without any assumption, thus rewriting the fundamental results on detectability.

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/173330.htm