PROJECT TITLE :

Symbolic Synthesis of Timed Models with Strict 2-Phase Fault Recovery - 2018

ABSTRACT:

In this article, we tend to concentrate on economical synthesis of fault-tolerant timed models from their fault-intolerant version. Although the complexity of the synthesis drawback is thought to be polynomial time in the size of the time-abstract bisimulation of the input model, the state of the art currently lacks synthesis algorithms that may be efficiently implemented. This is in part due to the actual fact that synthesis is normally a challenging drawback and its complexity is significantly magnified in the context of timed systems. We have a tendency to propose an algorithm that takes as input a timed automaton, a set of fault actions, and a collection of safety and bounded-time response properties, and utilizes a area-economical symbolic illustration of the timed automaton (called zone graph) to synthesize a fault-tolerant timed automaton as output. The output automaton satisfies strict phased recovery, where it is guaranteed that the output model behaves equally to the input model within the absence of faults and within the presence of faults, fault recovery is achieved in two phases, each satisfying sure safety and timing constraints.