Deciding Bisimilarity of Full BPA Processes Locally

Authors:
Lingyun Luo
Affiliations:
Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China 100190 and Graduate School of the Chinese Academy of Sciences,
Venue:
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Year:
2008

Citing 8
Cited 0

Decidability of bisimulation equivalence for processes generating context-free languages

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
A short proof of the decidability of bisimulation for normed BPA-processes

Information Processing Letters
A polynomial algorithm for deciding bisimilarity of normed context-free processes

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Bisimulation Equivalence is Decidable for all Context-Free Processes

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes

CONCUR '94 Proceedings of the Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a tableau algorithm to decide bisimilarity of guarded normed and unnormed BPA processes, which is very intuitive and direct. It also has the advantage of helping us to show that the equational theory proposed by Hüttel and Stirling for normed BPA systems is also complete for arbitrary guarded BPA systems. As a result, the first equational theory for full BPA processes is found.