一、题目

Detectability of discrete-event systems

二、主讲人

Kuize Zhang

三、摘要

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.

四、主讲人简介

Kuize Zhang received the B.S. and Ph.D. degrees in Mathematics and Control Science and Engineering from Harbin Engineering University, China, in 2009 and 2014, respectively. He is currently a lecturer at University of Surrey, UK. His main results interests include decidability and complexity of fundamental properties in Boolean control networks and diverse labeled (i.e., partially-observed) discrete-event and hybrid systems, including finite automata, Petri nets, timed automata, real-time automata, weighed automata over monoids, etc., with applications to systems biology and cyber security/privacy, etc. He has co-authored one monograph.

五、邀请人

于永渊，冯俊娥

六、时间

12月13日（周二）19:00-20:00

七、地点

腾讯会议

八、联系人

于永渊，联系方式：yyyu@sdu.edu.cn

九、主办

山东大学数学学院