Deciding the Bisimilarity of Context-Free Session Types

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.

[1]  Bernhard Steffen,et al.  An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes , 1995, MFCS.

[2]  Luca Aceto,et al.  Termination, deadlock, and divergence , 1992, JACM.

[3]  Yoram Hirshfeld,et al.  Bisimulation trees and the decidability of weak bisimulations , 1996, INFINITY.

[4]  Géraud Sénizergues,et al.  LALBLC A Program Testing the Equivalence of dpda's , 2013, CIAA.

[5]  Kohei Honda,et al.  Types for Dyadic Interaction , 1993, CONCUR.

[6]  D. Sangiorgi.  Introduction to Bisimulation and Coinduction , 2011 .

[7]  Petr Jancar,et al.  Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof) , 2012, Log. Methods Comput. Sci..

[8]  Søren Christensen,et al.  Bisimulation Equivalence is Decidable for all Context-Free Processes , 2022 .

[9]  Colin Stirling,et al.  Decidability of DPDA equivalence , 2001, Theor. Comput. Sci..

[10]  Luca Padovani.  Context-Free Session Type Inference , 2017, ESOP.

[11]  Peter Thiemann,et al.  Context-free session types , 2016, ICFP.

[12]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[13]  Stefan Kiefer.  BPA bisimilarity is EXPTIME-hard , 2013, Inf. Process. Lett..

[14]  Koen Claessen,et al.  QuickCheck: a lightweight tool for random testing of Haskell programs , 2000, ICFP.

[15]  Faron Moller,et al.  Techniques for Decidability and Undecidability of Bisimilarity , 1999, CONCUR.

[16]  Faron Moller,et al.  A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes , 1994, Theor. Comput. Sci..

[17]  Faron Moller,et al.  A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes , 1994, CONCUR.

[18]  Slawomir Lasota,et al.  Fast equivalence-checking for normed context-free processes , 2010, FSTTCS.

[19]  Simon J. Gay,et al.  Subtyping for session types in the pi calculus , 2005, Acta Informatica.

[20]  Kohei Honda,et al.  An Interaction-based Language and its Typing System , 1994, PARLE.

[21]  Didier Caucal.  Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples , 1986, STACS.

[22]  Géraud Sénizergues,et al.  The Equivalence Problem for Deterministic Pushdown Automata is Decidable , 1997, ICALP.

[23]  Jan A. Bergstra,et al.  Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.

[24]  Vasco Thudichum Vasconcelos,et al.  FreeST: Context-free Session Types in a Functional Language , 2019, PLACES@ETAPS.

[25]  Vasco Thudichum Vasconcelos,et al.  Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication , 1998, SecReT@ICALP.

[26]  Petr Jancar,et al.  Selected Ideas Used for Decidability and Undecidability of Bisimilarity , 2008, Developments in Language Theory.