Home
Scholarly Works
Synthesizing Masking Fault-Tolerant Systems from...
Conference

Synthesizing Masking Fault-Tolerant Systems from Deontic Specifications

Abstract

In this paper, we study the problem of synthesizing fault-tolerant components from specifications, i.e., the problem of automatically constructing a fault-tolerant component implementation from a logical specification of the component, and the system’s required level of fault-tolerance. We study a specific level of fault-tolerance: masking tolerance. A system exhibits masking tolerance when both the liveness and the safety properties of the behaviors of the system are preserved under the occurrence of faults. In our approach, the logical specification of components is given in dCTL, a branching time temporal logic with deontic operators, especially designed for fault-tolerant component specification. The synthesis algorithm takes the component specification, and automatically determines whether a component with masking fault-tolerance is realizable, and the maximal set of faults supported for this level of tolerance. Our technique for synthesis is based on capturing masking fault-tolerance via a simulation relation. Furthermore, a combination of an extension of a synthesis algorithm for CTL to cope with dCTL specifications, with simulation algorithms, is defined in order to synthesize masking fault-tolerant implementations.

Authors

Demasi R; Castro PF; Maibaum TSE; Aguirre N

Series

Lecture Notes in Computer Science

Volume

8172

Pagination

pp. 163-177

Publisher

Springer Nature

Publication Date

November 18, 2013

DOI

10.1007/978-3-319-02444-8_13

Conference proceedings

Lecture Notes in Computer Science

ISSN

0302-9743
View published work (Non-McMaster Users)

Contact the Experts team