This paper verifies inter-organizational BPMN collaborations by transforming them into Petri Nets with explicit buffer places for asynchronous messages, then checking deadlock freedom with LTL over the reachability graph. On 30 synthetic test cases, it achieved 0.96 precision and 0.98 recall with an average detection time of 0.15 seconds.