Verification of Detectability for Unambiguous Weighted Automata Using Self-Composition-Reference-Cited by-同舟云学术

Verification of Detectability for Unambiguous Weighted Automata Using Self-Composition

Published:2023-07-03 Issue: Volume: Page:
ISSN:
Container-title:2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)
language:
Short-container-title:

Author:

Miao Shaowen¹,Lai Aiwen¹,Yu Xiao²,Lahaye Sébastien³,Komenda Jan⁴

Affiliation:

1. Xiamen University,Department of Automation,Xiamen,China,361102

2. Xiamen University,Innovation Laboratory for Sciences and Technologies of Energy Materials of Fujian Province (IKKEM),Department of Automation,Xiamen,China,361102

3. University of Angers,LARIS,Angers,France,49000

4. Institute of Mathematics,Czech Academy of Sciences,Brno,Czech Republic,61662

Funder

National Natural Science Foundation of China

Natural Science Foundation of Fujian Province of China

National Key Research and Development Program of China

Fundamental Research Funds for the Central Universities

RVO

GAČR

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10284032/10284045/10284082.pdf?arnumber=10284082

Reference18 articles.

1. The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete

2. I-detectability of discrete-event systems;shu;IEEE Transactions on Automation Science and Engineering,2012

3. On Verification of Strong Periodic D-Detectability for Discrete Event Systems

4. Complexity of deciding detectability in discrete event systems

5. Detectability of Discrete Event Systems

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Verification of D-detectability for Unambiguous Weighted Automata;2023 38th Youth Academic Annual Conference of Chinese Association of Automation (YAC);2023-08-27