A novel matrix approach to observability analysis of finite automata

被引:15
作者
Gao, Na [1 ,2 ]
Han, Xiao-guang [1 ,2 ]
Chen, Zeng-qiang [1 ,2 ,3 ]
Zhang, Qing [3 ]
机构
[1] Nankai Univ, Dept Automat, Coll Comp & Control Engn, Tianjin, Peoples R China
[2] Nankai Univ, Tianjin Key Lab Intelligent Robot, Dept Automat, Tianjin, Peoples R China
[3] Civil Aviat Univ China, Dept Mathemat, Coll Sci, Tianjin, Peoples R China
关键词
Observability; discrete event dynamic systems (DEDSs); finite automata; mealy automata; semi-tensor product (STP) of matrices; BOOLEAN CONTROL NETWORKS; DISCRETE-EVENT SYSTEMS; SEMI-TENSOR PRODUCT; SUPERVISORY CONTROL; CONTROLLABILITY;
D O I
10.1080/00207721.2017.1384964
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, the observability of finite automata (acronym is FA) that contain both deterministic finite automata and non-deterministic finite automata is investigated under the framework of the semi-tensor product of matrices. For both initial state and current state cases, two different observability definitions with or without input information are considered, respectively. First, we show that how the observability problem of initial state of FA can be transformed to the construction problem of an initial state-outputs matrix that presents the relationship between initial state and outputs. Second, a current state-outputs matrix to verify the observability problem of current state is given. When two matrices are obtained, four theorems to verify the observability of initial state and current state are presented, respectively. In particular, compared with the existing approach, the proposed approach not only provides a unified verification for the two types of observability of both initial state and current state but also reduces the computational complexity considerably. An illustrative example is presented to show the theoretical results.
引用
收藏
页码:3558 / 3568
页数:11
相关论文
共 50 条
[31]   Finite-time observability of probabilistic Boolean control networks [J].
Pan, Qinyao ;
Zhong, Jie ;
Lin, Lin ;
Li, Bowen ;
Liu, Xiaoxu .
ASIAN JOURNAL OF CONTROL, 2023, 25 (01) :325-334
[32]   Using the theories of finite automata and formal languages to determine observability of switched Boolean control networks [J].
Zhang, Kuize ;
Zhang, Lijun ;
Xie, Lihua ;
Jiang, Zhe .
2015 54TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2015, :4214-4219
[33]   A novel matrix approach for the stability and stabilization analysis of colored Petri nets [J].
Zhao, Jiantao ;
Chen, Zengqiang ;
Liu, Zhongxin .
SCIENCE CHINA-INFORMATION SCIENCES, 2019, 62 (09)
[34]   Controllability, Reachability, and Stabilizability of Finite Automata: A Controllability Matrix Method [J].
Li, Yalu ;
Dou, Wenhui ;
Li, Haitao ;
Liu, Xin .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
[35]   The Method of System Observability Analysis Using Pseudo-Inverse of System Observability Matrix [J].
Dong Jin-long ;
Mo Bo .
2013 32ND CHINESE CONTROL CONFERENCE (CCC), 2013, :55-59
[36]   Observability Analysis of SLAM Using Fisher Information Matrix [J].
Wang, Zhan ;
Dissanayake, Gamini .
2008 10TH INTERNATIONAL CONFERENCE ON CONTROL AUTOMATION ROBOTICS & VISION: ICARV 2008, VOLS 1-4, 2008, :1242-1247
[37]   Initial-State Observability of Mealy-Based Finite-State Machine With Nondeterministic Output Functions [J].
Zhang, Zhipeng ;
Xia, Chengyi ;
Fu, Jun ;
Chen, Zengqiang .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (10) :6396-6405
[38]   Supervisor Synthesis for Mealy Automata With Output Functions: A Model Transformation Approach [J].
Yin, Xiang .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2017, 62 (05) :2576-2581
[39]   A Novel Stream Cipher Based on Nondeterministic Finite Automata [J].
Khaleel, Ghassan ;
Turaev, Sherzod ;
Zhukabayeva, Tamara .
PROCEEDINGS OF THE 2016 CONFERENCE ON INFORMATION TECHNOLOGIES IN SCIENCE, MANAGEMENT, SOCIAL SPHERE AND MEDICINE (ITSMSSM), 2016, 51 :110-115
[40]   Observability of Boolean networks: A graph-theoretic approach [J].
Laschov, Dmitriy ;
Margaliot, Michael ;
Even, Guy .
AUTOMATICA, 2013, 49 (08) :2351-2362