We investigate the model checking problem for a class of petri nets using net unfoldings. Net unfoldings are a well studied partial order semantics for petri nets and are well-suited for modeling concurrent and distributed systems. We consider the problem of model checking LTL-X (LTL without the next time operator) with fairness assumptions for the class of one-safe petri nets. Recently, in  the authors have proposed a new technique for LTL model checking that exploits the partial order semantics of these net unfoldings. We propose a technique for incorporating fairness assumptions as part of the model while checking LTL properties. Fairness assumptions are often necessary for faithfully modeling a distributed computation. Our method extends the model checking algorithm presented by the authors in  and draws machinery from petri net theory and automata theory. Our method has the advantage that it is linear in the number of fairness assumptions and the size of the unfolding developed. Thus, it is practical to check large structures with underlying fairness assumptions.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.