Decidability of Weak Bisimilarity for a Subset of BPA

DOI10.1016/j.entcs.2008.04.065zbMath1286.68347OpenAlexW1993247717MaRDI QIDQ5415622

Hai-Yan Chen

Publication date: 13 May 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.065

zbMATH Keywords

tableauBPAdecidabiltynormed

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• A calculus of communicating systems
• A short proof of the decidability of bisimulation for normed BPA- processes
• Decidability of bisimulation equivalence for normed pushdown processes
• Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
• Bisimulation equivalence is decidable for all context-free processes
• Decidability of model checking for infinite-state concurrent systems
• Decidability of bisimulation equivalence for process generating context-free languages
• Deciding Weak Bisimilarity of Normed Context-Free Processes Using Tableau
• An elementary bisimulation decision procedure for arbitrary context-free processes
• Actions speak louder than words: proving bisimilarity for context-free processes
• Infinite results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item