Complex applications consist of a large set of interrelated transactions. Often, it is very difficult for the application/transaction designer to get a grasp of the transitive relationships among the transactions of a complex application. In this paper, we discuss transitive termination dependencies under consideration of transaction compensation and present an algorithm to derive a set of rules for reasoning about transitive dependencies. These rules may help the designer in understanding the entire semantics of a complex application and detecting contradictory dependency specifications.