The main result of the paper states that a set F of propositional-logic formulas is contradictory iff in all net representations of F the empty marking is reproducible.
['Kurt Lautenbach']
Logical reasoning and Petri nets