Verifying fault-tolerant distributed systems using object-based graph grammars
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Model checking propositional deontic temporal logic via a μ-calculus characterization
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
Hi-index | 0.00 |
Model checking is a technique that can make averificationfor finite state systems absolutely automatic.We pro-posea method for automatic verification of fault-tolerantsystems using this technique.Unlike other related work,which is tailored to specific systems, we are aimed at providinga general approach to verification of fault tolerance.The main obstacle in model checking is state explosion.Toavoid the problem, we design this method so that it canuse SMV, a symbolic model checking tool.Symbolic modelchecking can overcome the problem by expressing the statespace and the transition relation by Boolean functions. Assuming that a system to be verified is specified by guardedcommands, we define a modeling language suited for describingguarded command programs and propose a translationmethod from the modeling language to the input languageof SMV.We show the results of applying the proposedmethod to various examples to demonstrate the usefulness.