Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes
Abstract elided by the publisher.
Related papers
- Deciding the Bisimilarity of Context-Free Session Types TACAS 2020
- Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable APLAS 2009
- Faster Signature Refinement for Branching Bisimilarity Minimization TACAS 2026
- Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities TACAS 2020
- GPU Accelerated Strong and Branching Bisimilarity Checking TACAS 2015
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems TACAS 2020
- System Fμ ømega with Context-free Session Types ESOP 2023
- Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types ESOP 2020