Skip to content
naulon
Not checkedNot checked for notices yet.

Fault-Recovery and Repair Modeling of Discrete Event Systems Using Petri Nets

Ebrahim Ali Alzalab, Zhenhua Yu, Naiqi Wu and 1 more

IEEE Access · 2020

doi:10.1109/access.2020.3022694 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Despite advances in automated manufacturing systems (AMSs), faults occur from time to time, which cannot be avoided in a complex real system. A fault is one of the primary causes of failures making some AMS operations unable to complete, and the diagnosis is one of the most important steps in fault-recovery and repair. This work develops a methodology for investigating the behavior of faults on the resources in discrete event systems that are failure-prone. We tackle the fault-tolerant problem and propose a method to make the system able to continue performing its duties, while the failed resources are under a repair and recovery process. In this work, a failure-safe model is proposed and, at the same time, a method for fault recovery and repair of a faulty element is presented without interrupting task processing due to the occurrence of fault to some elements. We use redundant elements to replace the target elements, and these redundant elements are used to do the same work as the target elements do, when faults occur to the target elements. A target element is an unreliable element that is prone to failure. After a faulty target element is repaired and recovered, its failure model is automatically replaced by its repaired model to indicate that the corresponding element has returned to work. The proposed method is tested using an application example. The results show, compared with those obtained by the studies in the literature, that the proposed method has a great performance and outperforms the existing studies.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.