Fault tolerance makespan synthesis in multi-process systems via resource sharing and backtracking

This paper proposes an algorithms to find the time optimal fault-tolerant controllable string for multi-process systems, in which some specifications are enforced to the nonfaulty system, such that the system can recover from faults and satisfy the specifications efficiently through resource sharing. We first derive an algorithm to check the fault-tolerant property via the abstraction of the system, then a backtracking algorithm is sequentially used to find the optimal fault-tolerant string based on the abstraction of the system. Moreover, the proposed fault tolerant string synthesis algorithms are tested on a simulated manufacturing system to show their effectiveness. Copyright (C) 2022 The Authors.

Automated summary

This paper proposes an algorithm to find the time optimal fault-tolerant controllable string for multi-process systems. It enforces specifications to the nonfaulty system to ensure efficient fault recovery and specification satisfaction through resource sharing. The algorithm checks the fault-tolerant property and sequentially finds the optimal fault-tolerant string based on system abstraction using a backtracking algorithm. The effectiveness of the proposed fault tolerant string synthesis algorithm is demonstrated through testing on a simulated manufacturing system.