Model Checking LTL Using Net Unfoldings

Document type:: Technical Report
Author(s):: Frank Wallner
Title:: Model Checking LTL Using Net Unfoldings
Abstract:: Net unfoldings are a well-studied partial order semantics for Petri nets. In this paper, we show that the finite prefix of an unfolding, introduced by McMillan, is suited for model checking linear-time temporal properties. The method is based on the so-called automata-theoretic approach to model checking. We propose a technique to treat this approach within the framework of safe Petri nets, and give an efficient algorithm for detecting the system runs violating a given specification.
Keywords:: Model Checking; LTL; Net Unfoldings
Year:: 1997
Year / month:: 1997-12-01 00:00:00
Pages:: 14
BibTeX

Occurrences: