Loading...

Using on-the-fly Translation of Temporal Logic to Automata in Model Checking

Salehi Ghahfarokhi, Khayyam | 2010

420 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 40102 (02)
  4. University: Sharif University of Technology
  5. Department: Mathematical Sciences
  6. Advisor(s): Ardeshir, Mohammad; Izadi, Mohammad
  7. Abstract:
  8. According to increasing computer systems, needs for verification of such systems with respect to desirable properties is critical. Model checking is one of the best methods of verification. Different methods have been proposed for model checking. The most efficient of these methods is automata-theoretic approach. In this approach, formal specification of desirable property, specified by formula in temporal logics, is translated to corresponding automaton. If the system model is expressed as automaton, the problem of model checking is then reduced to a problem of automata-theory. The question is the following. Are all the computations of the corresponding automaton accepted by the automaton correspond to the formula? We can translate the negation of formula to automaton and reduce the verification problem to the nonemptiness problem of intersection of two automatons corresponding system model and negation formula. One of the translation methods is ordinary translation in which the entire formula is completely translated to automaton. Another method translates formula regarding its inductive structure step by step to automaton. We can simultaneously verify the nonemptiness problem of intersection of those automatons. This method is called on-the-fly translation. In this MS project we introduce such method and explain its soundness and completeness and also one of the newest methods for nonemptiness problem in on-the-fly translation is presented
  9. Keywords:
  10. Model Cheking ; Temporal Logic ; Automata Theory ; Verification ; On-The-Fly Translation ; Nonemptiness Problem

 Digital Object List

 Bookmark

No TOC