Deciding the Bisimilarity of Context-Free Session Types
From MaRDI portal
Publication:5164167
DOI10.1007/978-3-030-45237-7_3zbMath1483.68219OpenAlexW3017168772MaRDI QIDQ5164167
Andreia Mordido, Bernardo F. Almeida, Vasco Thudichum Vasconcelos
Publication date: 10 November 2021
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45237-7_3
Theory of compilers and interpreters (68N20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (6)
Mixed Sessions ⋮ The different shades of infinite session types ⋮ Nested session types ⋮ Mixed sessions ⋮ Session Types with Arithmetic Refinements ⋮ Polymorphic lambda calculus with context-free session types
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- Bisimulation equivalence is decidable for all context-free processes
- BPA bisimilarity is EXPTIME-hard
- Subtyping for session types in the pi calculus
- A lattice-theoretical fixpoint theorem and its applications
- Context-free session types
- Context-Free Session Type Inference
- Introduction to Bisimulation and Coinduction
- Decidability of bisimulation equivalence for process generating context-free languages
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity
- An elementary bisimulation decision procedure for arbitrary context-free processes
- Termination, deadlock, and divergence
- The equivalence problem for deterministic pushdown automata is decidable
- Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
- LALBLC A Program Testing the Equivalence of dpda’s
- Decidability of DPDA equivalence
This page was built for publication: Deciding the Bisimilarity of Context-Free Session Types
