In: Lecture Notes in Computer Science, Vol. 1853: Automata, Languages and Programming, pages 475-486. Springer-Verlag, 2000.
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.
Keywords: LTL model checking, linear temporal logics, net unfolding, occurrence nets.
Back to the Petri Nets Bibliography