Home
Scholarly Works
syntMaskFT: A Tool for Synthesizing Masking...
Conference

syntMaskFT: A Tool for Synthesizing Masking Fault-Tolerant Programs from Deontic Specifications

Abstract

In this paper we introduce syntMaskFT, a tool that synthesizes fault-tolerant programs from specifications written in a fragment of branching time logic with deontic operators, designed for specifying fault-tolerant systems. The tool focuses on producing masking tolerant programs, that is, programs that during a failure mask faults in such a way that they cannot be observed by the environment. It is based on an algorithm we have introduced in previous work, and shown to be sound and complete. syntMaskFT takes a specification and automatically determines whether a masking fault-tolerant component is realizable; in such a case, a description of the component is produced together with the maximal set of faults that can be supported for this level of tolerance. We present the ideas behind the tool by means of a simple example, and also report the result of experiments realized with more complex case studies.

Authors

Demasi R; Castro PF; Ricci N; Maibaum TSE; Aguirre N

Series

Lecture Notes in Computer Science

Volume

9035

Pagination

pp. 188-193

Publisher

Springer Nature

Publication Date

January 1, 2015

DOI

10.1007/978-3-662-46681-0_13

Conference proceedings

Lecture Notes in Computer Science

ISSN

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

Contact the Experts team