As proved in [1]}, any LTL formula can be transformed into a non-deterministic Büchi automaton that accepts all and only the input strings satisfying the formula. Automatic translation from an LTL formula to Büchi automaton can be done by using available tools, for example [2]}, [3]}, [4]}. The property of LTL being close under stuttering [5]} is exploited in the paper. This means that any finite repetition of the same input does not modify the truth value of the input string. The stuttering is useful in Section , when the obtained solution in the reduced Quotient Petri net model is projected into the original RMPN.
