Let me make a weaker claim instead of a full equivalence.

*Is (Boolean) satisfiability a type of reachability*?

Or in constructivist language, can we build the various Boolean operations and model SAT problems internally in Petri-nets or other equivalent models of resource theories?

The answer seems "yes" because Petri-nets are in a computationally stronger class.