Semitensor Product Approach to Controllability, Reachability, and Stabilizability of Probabilistic Finite Automata

被引：6
|
作者：
Dou, Wenhui [1 ]
Li, Haitao [1 ]
Alsaadi, Fuad E. [2 ]
机构：
[1] Shandong Normal Univ, Sch Math & Stat, Jinan 250014, Shandong, Peoples R China
[2] King Abdulaziz Univ, Fac Engn, Dept Elect & Comp Engn, Jeddah 21589, Saudi Arabia
来源：
MATHEMATICAL PROBLEMS IN ENGINEERING | 2019年 / 2019卷
基金：
中国国家自然科学基金;
关键词：
BOOLEAN NETWORKS; STABILIZATION; DETECTABILITY;
D O I：
10.1155/2019/8021750
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper proposes a matrix-based approach to investigate the controllability, reachability, and stabilizability of probabilistic finite automata (PFA). Firstly, the state transition probabilistic structure matrix is constructed for PFA, based on which a kind of controllability matrix is defined for PFA. Secondly, some necessary and sufficient conditions are presented for the controllability, reachability, and stabilizability of PFA with positive probability by using the controllability matrix. Finally, an illustrate example is given to validate the obtained new results.
引用
收藏
页数：7
相关论文
共 50 条
  • [41] Algebraic properties of probabilistic finite state automata
    Xie, Zhengwei
    Zhai, Ying
    Deng, Peimin
    Yi, Zhong
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2013, 50 (12): : 2691 - 2698
  • [42] FUZZY EVENTS REALIZED BY FINITE PROBABILISTIC AUTOMATA
    NASU, M
    HONDA, N
    INFORMATION AND CONTROL, 1968, 12 (04): : 284 - &
  • [43] Approximating Probabilistic Models as Weighted Finite Automata
    Suresh, Ananda Theertha
    Roark, Brian
    Riley, Michael
    Schogol, Vlad
    COMPUTATIONAL LINGUISTICS, 2021, 47 (02) : 221 - 254
  • [44] On the learnability and usage of acyclic probabilistic finite automata
    Ron, D
    Singer, Y
    Tishby, N
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 56 (02) : 133 - 152
  • [45] Reducing memory requirements in reachability-based finite automata operations
    Watson, BW
    SOFTWARE-PRACTICE & EXPERIENCE, 2004, 34 (03): : 239 - 248
  • [46] Robust Reachability in Timed Automata: A Game-Based Approach
    Bouyer, Patricia
    Markey, Nicolas
    Sankur, Ocan
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012, PT II, 2012, 7392 : 128 - 140
  • [47] Product-forms for Probabilistic Input/Output Automata
    Cavallin, Filippo
    Marin, Andrea
    Rossi, Sabina
    2016 IEEE 24TH INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS (MASCOTS), 2016, : 361 - 366
  • [48] Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
    Jovanovic, Aleksandra
    Kwiatkowska, Marta
    Norman, Gethin
    Peyras, Quentin
    THEORETICAL COMPUTER SCIENCE, 2017, 669 : 1 - 21
  • [49] Finite-Time Controllability and Set Controllability of Impulsive Probabilistic Boolean Control Networks
    Wang, Jing
    Liu, Yansheng
    Li, Haitao
    IEEE ACCESS, 2020, 8 : 111995 - 112002
  • [50] A Note on Three-Dimensional Probabilistic Finite Automata
    Sakamoto, M.
    Ito, T.
    Qingquan, X.
    Uchida, Y.
    Yoshinaga, T.
    Yokomichi, M.
    Ikeda, S.
    Furutani, H.
    PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 17TH '12), 2012, : 492 - 495
12345