A New Unfolding Approach to LTL Model Checking

Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniques presented so far required to run an elaborate algorithm on the prefix.

• Type: Conference
• Year: 2000
• Where: ICALP
• Authors: Javier Esparza, Keijo Heljanko
• Keywords: Certain Finite Prefix, ICALP 2000, Model Checking, Model Checking Problem, Programming Languages