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 条
  • [31] ADJUSTMENT EXPERIMENTS WITH FINITE PROBABILISTIC AUTOMATA
    MAKAREVICH, LV
    MATEVOSYAN, AA
    AUTOMATION AND REMOTE CONTROL, 1972, 33 (08) : 1327 - 1330
  • [32] Cost optimal reachability with probability bound in priced probabilistic timed automata
    Zhang, Junhua
    Huang, Zhiqiu
    Zhong, Jing
    Cao, Zining
    ADVANCING SCIENCE THROUGH COMPUTATION, 2008, : 162 - 164
  • [33] Probably on time and within budget - On reachability in priced probabilistic timed automata
    Berendsen, Jasper
    Jansen, David N.
    Katoen, Joost-Pieter
    QEST 2006: THIRD INTERNATIONAL CONFERENCE ON THE QUANTITATIVE EVALUATION OF SYSTEMS, 2006, : 311 - +
  • [34] An MTBDD-based implementation of forward reachability for probabilistic timed automata
    Wang, F
    Kwiatkowska, M
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2005, 3707 : 385 - 399
  • [35] Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
    Berendsen, Jasper
    Chen, Taolue
    Jansen, David N.
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 128 - +
  • [36] The complexity of probabilistic versus deterministic finite automata
    Ambainis, A
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 233 - 238
  • [37] PROBABILISTIC EXAMINATION OF TRANSITION PROCESS IN FINITE AUTOMATA
    LEVIN, VI
    ENGINEERING CYBERNETICS, 1976, 14 (01): : 74 - 84
  • [38] The complexity of probabilistic versus quantum finite automata
    Midrijanis, G
    SOFSEM 2002: THEORY AND PRACTICE OF INFORMATICS, 2002, 2540 : 273 - 278
  • [39] REPRESENTABILITY OF NONREGULAR LANGUAGES IN FINITE PROBABILISTIC AUTOMATA
    KNAST, R
    INFORMATION AND CONTROL, 1970, 16 (03): : 285 - &
  • [40] Learning probabilistic residual finite state automata
    Esposito, Y
    Lemay, A
    Denis, F
    Dupont, P
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLIICATIONS, 2002, 2484 : 77 - 91
12345