A key open problem with multiparty session types (MPST) concerns their expressiveness: current MPST have inflexible choice, no existential quantification over participants, and limited parallel composition. This precludes many real protocols to be represented by MPST. To overcome these bottlenecks of MPST, we explore a new technique using weak bisimilarity between global types and endpoint types, which guarantees deadlock-freedom and absence of protocol violations. Based on a process algebraic framework, we present well-formed conditions for global types that guarantee weak bisimilarity between a global type and its endpoint types and prove their check is decidable. Our main practical result, obtained through benchmarks, is that our well-formedness conditions can be checked orders of magnitude faster than directly checking weak bisimilarity using a state-of-the-art model checker.

Additional Metadata
Persistent URL dx.doi.org/10.1007/978-3-030-44914-8_10
Series Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence
Conference European Symposium on Programming
Jongmans, S.-S.T.Q, & Yoshida, N. (2020). Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-030-44914-8_10