Deciding the Bisimilarity of Context-Free Session Types-Reference-Cited by-同舟云学术

Deciding the Bisimilarity of Context-Free Session Types

Published:2020 Issue: Volume: Page:39-56
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Almeida Bernardo^ORCID,Mordido Andreia^ORCID,Vasconcelos Vasco T.^ORCID

Abstract

AbstractWe 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.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-45237-7_3

Reference26 articles.

1. Aceto, L., Hennessy, M.: Termination, deadlock, and divergence. J. ACM 39(1), 147–187 (1992)

2. Almeida, B., Mordido, A., T. Vasconcelos, V.: Freest: Context-free session types in a functional language. In: Proceedings Programming Language Approaches to Concurrency- and Communication-cEntric Software. Electronic Proceedings in Theoretical Computer Science, vol. 291, pp. 12–23. Open Publishing Association (2019). https://doi.org/10.4204/EPTCS.291.2

3. Baeten, J.C., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for process generating context-free languages. Journal of the ACM (JACM) 40(3), 653–682 (1993)

4. Burkart, O., Caucal, D., Steffen, B.: An elementary bisimulation decision procedure for arbitrary context-free processes. In: Mathematical Foundations of Computer Science. pp. 423–433 (1995). https://doi.org/10.1007/3-540-60246-1_148

5. Caucal, D.: Décidabilité de l’égalité des langages algébriques infinitaires simples. In: Annual Symposium on Theoretical Aspects of Computer Science. pp. 37–48. Springer (1986)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polymorphic higher-order context-free session types;Theoretical Computer Science;2024-06

2. Parametric Subtyping for Structural Parametric Polymorphism;Proceedings of the ACM on Programming Languages;2024-01-05

3. Parameterized Algebraic Protocols;Proceedings of the ACM on Programming Languages;2023-06-06

4. System $$F^\mu _\omega $$ with Context-free Session Types;Programming Languages and Systems;2023

5. Polymorphic lambda calculus with context-free session types;Information and Computation;2022-11