Deciding the Bisimilarity of Context-Free Session Types
Abstract We present an algorithm to decide the equivalence of context-free session types, practical to the point of being incorporated in a compiler. We prove its soundness and completeness. We further evaluate its behaviour in practice. In the process, we introduce an algorithm to decide the bisimilarity of simple grammars.
2021 ◽
Vol 43
(2)
◽
pp. 1-55
2019 ◽
Vol 291
◽
pp. 12-23
2018 ◽
Vol 276
◽
pp. 3-18
Keyword(s):
Keyword(s):