Deciding Bisimilarity of Full BPA Processes Locally

DOI10.1007/978-3-540-88387-6_30zbMath1183.68402OpenAlexW2134061382MaRDI QIDQ3540084

Lingyun Luo

Publication date: 20 November 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88387-6_30

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A complete inference system for a class of regular behaviours
• A short proof of the decidability of bisimulation for normed BPA- processes
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• Bisimulation equivalence is decidable for all context-free processes
• Graphes canoniques de graphes algébriques
• An elementary bisimulation decision procedure for arbitrary context-free processes
• Actions speak louder than words: proving bisimilarity for context-free processes

This page was built for publication: Deciding Bisimilarity of Full BPA Processes Locally