Current-State Opacity Formulations in Probabilistic Finite Automata (vol 59, pg 120, 2014)

被引：0

作者：

Saboori, Anooshiravan ^{[1
]}

Hadjicostis, Christoforos N. ^{[2
]}

机构：

[1] Snowflake Inc, San Mateo, CA 94402 USA

[2] Univ Cyprus, Dept ECE, CY-1678 Nicosia, Cyprus

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2024年 / 69卷 / 05期

关键词：

Automata; discrete event systems (DES); Markov processes; opacity; verification complexity;

D O I：

10.1109/TAC.2024.3371912

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This note identifies a flaw in the proof of Theorem 16 in (Saboori and Hadjicostis, 2014). It also discusses how the statement of Theorem 16 can be adjusted and provides the corresponding proof.

引用

页码：3480 / 3481

页数：2

共 4 条

[1] Reachability problems for Markov chains
Akshay, S.
Antonopoulos, Timos
Ouaknine, Joel
Worrell, James
[J]. INFORMATION PROCESSING LETTERS, 2015, 115 (02) : 155 - 158
[2] Bremaud P., 2001, Markov Chains: Gibhx Fields, Monte Carlo Simulation, and Queues
[3] Horn R.A., 1990, Matrix Analysis, DOI 10.1017/CBO9780511810817
[4] Current-State Opacity Formulations in Probabilistic Finite Automata
Saboori, Anooshiravan
Hadjicostis, Christoforos N.
[J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2014, 59 (01) : 120 - 133

← 1 →