Efficient Subtyping Algorithms for Binary Session Types and their Complexity Analyses

This paper presents three algorithms for checking subtyping of binary session types, along with their complexity analyses. The first algorithm is based on an inductive tree search, the second is an optimized version of the first, and the third is a new quadratic algorithm based on graph search using the concept of X Y Z W-simulation.