J4

• Original Articles • Previous Articles     Next Articles

Model checking interval temporal logic

ZHANG Hai-bin;DUAN Zhen-hua
  

  1. (School of Computer Science and Technology, Xidian Univ., Xi’an 710071, China)
  • Received:2008-02-20 Revised:1900-01-01 Online:2009-04-20 Published:2009-05-23
  • Contact: ZHANG Hai-bin E-mail:hbzhang@mail.xidian.edu.cn

Abstract: To check whether a system represented by a labelled finite state automaton meets a property described by an interval temporal logic formula, a set of rules are defined. Using such rules, a chop-automaton which accepts all intervals satisfying this interval temporal logic formula can be constructed. In addition, a rule for translating a chop-automaton to a labelled finite state automaton is also defined. Thus, the model checking problem for the interval temporal logic can be solved by testing language inclusion between two labelled finite state automata.

Key words: model checking, temporal logic, automata

CLC Number: 

  • TP301