Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Specification and verification of fault-tolerance, timing, and scheduling
ACM Transactions on Programming Languages and Systems (TOPLAS)
Nest: A Nested-Predicate Scheme for Fault Tolerance
IEEE Transactions on Computers
Validating Requirements for Fault Tolerant Systems using Model Checking
ICRE '98 Proceedings of the 3rd International Conference on Requirements Engineering: Putting Requirements Engineering to Practice
On Bisimulation, Fault-Monotonicity and Provable Fault-Tolerance
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Specifying and Verifying Fault-Tolerant Systems
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
µcke - Efficient µ-Calculus Model Checking
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Automatic Verification of Fault Tolerance Using Model Checking
PRDC '01 Proceedings of the 2001 Pacific Rim International Symposium on Dependable Computing
Verification of Reactive Systems: Formal Methods and Algorithms
Verification of Reactive Systems: Formal Methods and Algorithms
Towards specification, modelling and analysis of fault tolerance in self managed systems
Proceedings of the 2006 international workshop on Self-adaptation and self-managing systems
A Temporal Logic of Robustness
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
A Tableaux System for Deontic Action Logic
DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
A Rigorous Approach to Fault-Tolerant Programming
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
In this paper, we present a characterization of a propositional deontic temporal logic into μ-calculus. This logic has been proposed to specify and reason about fault tolerant systems, and even though is known to be decidable, no tool realizing its corresponding decision procedure has been developed. A main motivation for our work is enabling for the use of model checking, for analyzing specifications in this deontic temporal logic. We present the technical details involved in the characterization, and prove that the model checking problem on the deontic temporal logic is correctly reduced to μ-calculus model checking. We also show that counterexamples are preserved, which is crucial for our model checking purposes. Finally, we illustrate our approach via a case study, including the verification of some properties using a μ-calculus model checker.