Deciding Bisimilarity of Full BPA Processes Locally
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.
KeywordsBasic Step Equational Theory Operational Semantic Label Transition System Fresh Variable
Unable to display preview. Download preview PDF.
- 4.Christensen, S., Hüttel, H., Stirling, C.: Bisimulation equivalence is decidable for all context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630. Springer, Heidelberg (1992)Google Scholar
- 8.Hüttel, H., Stirling, C.: Action speaks louder than words: Proving bisimilarity for context-free processes. In: Proceedings on Logic in Computer Science (1991)Google Scholar