Search

Model checking is a technique to decide whether a system modeled by a state graph satisfies a temporal logic formula. A serious problem in model checking of practical systems is that the size of the state graphs becomes huge. One solution of this problem is symbolic model checking, in which sets of states and transition relations over states are represented and handled symbolically. This research studies symbolic model checking in which realtime systems are modeled by time Petri nets and specifications are expressed by computation tree logic formulas. As realtime systems potentially have infinite state spaces, techniques to reduce infinite state spaces to finite ones are necessary. This paper discusses a technique based on equivalence classes, called regions, of states as well as a technique to restrict the behavior of time Petri nets so that transitions fire only at integer times. The algorithm in the former approach is presented in detail and then some experimental results are shown. © 1997 Scripta Technica, Inc. Electron Comm Jpn Pt 3, 80(4): 11–20, 1997 [ABSTRACT FROM AUTHOR]