The paper solves an open problem from [4] by showing a decision algorithm for a temporal logic language L( Q′, GF). It implies the decidability of the problem of the existence of an infinite weakly fair occurence sequence for a given Petri net; thereby an open problem from [2] is solved.