Synthesizing masking fault-tolerant systems from deontic specifications

DOI10.1007/978-3-319-02444-8_13MaRDI QIDQ5166687zbMATH OpenOpenAlexFDO

Authors Ramiro Demasi, Pablo F. Castro, Tim Maibaum, Nazareno Aguirre

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02444-8_13

zbMATH Keywords

correctness by constructiondeontic logicsfault-toleranceformal specificationprogram synthesistemporal logics

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Synthesis of fault-tolerant distributed systems
• dCTL: a branching time temporal logic for fault-tolerant system verification
• Symbolic synthesis of masking fault-tolerant distributed programs
• Automating the addition of fault tolerance with discrete controller synthesis
• Synthesis of fault-tolerant embedded systems using games: from theory to practice

Cited in

(8)

• Simulation relations for fault-tolerance
• Symbolic synthesis of masking fault-tolerant distributed programs
• Synthesis of fault-tolerant embedded systems using games: from theory to practice
• dCTL: a branching time temporal logic for fault-tolerant system verification
• Characterizing locality (encapsulation) with bisimulation
• Synthesis of fault-tolerant distributed systems
• Measuring masking fault-tolerance
• Encapsulating deontic and branching time specifications

This page was built for publication: Synthesizing masking fault-tolerant systems from deontic specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166687)