The Minimal Cost Algorithm for Off-Line Diagnosability of Discrete Event Systems
Zhujun Fan
Abstract
The failure diagnosis for discrete event systems (DESs) has been given considerable attention in recent years. Both on-line and off-line diagnostics in the framework of DESs was first considered by Lin Feng in 1994, and particularly an algorithm for diagnosability of DESs was presented. Motivated by some existing problems to be overcome in previous work, in this paper, we investigate the minimal cost algorithm for diagnosability of DESs. More specifically: (i) we give a generic method for judging a system's off-line diagnosability, and the complexity of this algorithm is polynomial-time; (ii) and in particular, we present an algorithm of how to search for the minimal set in all observable event sets, whereas the previous algorithm may find non-minimal one.
Create a lesson
Related papers
Scaffolding Foundation Models into Physical-World Agents Pushes the Frontier of Long-Horizon Navigation
Zixing Lei, Gengze Zhou, Xiong-Hui Chen et al.
Augmenting Human Performance with an XR Agent Learning from Online Behavior and BCI Evidence
Ziheng Li, Xichen He, Haoyan Chen et al.
Will the User Ever Know? Covert Indirect Prompt Injection on Tool-Using LLM Agents
Yunseok Lee, Yunji Kim, Woojin Lee
Co-Annotator: Expert-Distilled ViT and VLM for Visual and Documentation Guidance in Age-Related Macular Degeneration
Ziheng "Leo" Li, Benjamin Freeman, Akshay Raman et al.
Answer Probing-Guided Search for Diverse Solution Exploration of LLMs
Yi Fang, Que Shen, Chengpeng Li et al.
Ignorance or Incompetence? Constructing Knowledge-Gated, Verifiable Tasks for LLM Agents
Hanlin Tian, Minhao Li, Yu Mi et al.