The complexity of automated addition of fault-tolerance without explicit legitimate states

DOI10.1007/S00446-014-0227-2MaRDI QIDQ2355327zbMATH OpenOpenAlexFDO

Authors Fuad Abujarad, Yiyan Lin, Borzoo Bonakdarpour, Sandeep S. Kulkarni

Publication date 22 July 2015

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-014-0227-2

zbMATH Keywords

automated formal methodsfault-tolerancemodel repairprogram synthesis

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Abstract Model Repair
• Automated constraint-based addition of nonmasking and stabilizing fault-tolerance
• scientific article; zbMATH DE number 1696500
• Weakest invariant generation for automated addition of fault-tolerance
• Automated repair for timed systems

Cites work

• A case study in the mechanical verification of fault tolerance
• Alternating-time temporal logic
• Automating the addition of fault tolerance with discrete controller synthesis
• Computer Aided Verification
• Decentralized control and coordination of discrete-event systems with partial observation
• Defining liveness
• Fault diagnosis for timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Foundations of Software Science and Computational Structures
• scientific article; zbMATH DE number 1696500 (Why is no real title available?)
• scientific article; zbMATH DE number 438994 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1487476 (Why is no real title available?)
• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• scientific article; zbMATH DE number 2086417 (Why is no real title available?)
• On the synthesis of discrete controllers for timed systems
• On the synthesis of strategies in infinite games
• Optimal Supervisory Control of Discrete Event Dynamical Systems
• Symbolic model checking for real-time systems
• Symbolic model checking: \(10^{20}\) states and beyond
• Symbolic synthesis of finite-state controllers for request-response specifications
• Symbolic synthesis of masking fault-tolerant distributed programs
• Synthesis of discrete-event controllers based on the signal environment
• Think globally, act locally: decentralized supervisory control
• Timed control with partial observability.
• Weakest invariant generation for automated addition of fault-tolerance

Cited in

(3)

• Automatic addition of conflicting properties
• MR4UM: a framework for adding fault tolerance to UML state diagrams
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems

Describes a project that uses

Uses Software

• Sycraft
• CUDD

This page was built for publication: The complexity of automated addition of fault-tolerance without explicit legitimate states

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