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.
Supported by Chinese NSF grant 60496320.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for process generating context-free languages. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 94–113. Springer, Heidelberg (1987)
Burkart, O., Caucal, D., Steffen, B.: An elementary bisimulation decision procedure for arbitrary context-free processes. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969. Springer, Heidelberg (1995)
Caucal, D.: Graphes canoniques de graphes algébriques. Informatique Théorique et Applications(RAIRO) 24(4), 339–352 (1990)
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)
Groote, J.F.: A short proof of the decidability of bisimulation for normed bpa-processes. Inform. process. lett. 42, 167–171 (1991)
Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimulation of normed context-free processes. Theoretical Computer Science 15, 143–159 (1996)
Hirshfeld, Y., Moller, F.: A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 48–63. Springer, Heidelberg (1994)
Hüttel, H., Stirling, C.: Action speaks louder than words: Proving bisimilarity for context-free processes. In: Proceedings on Logic in Computer Science (1991)
Hüttel, H., Stirling, C.: Action speaks louder than words: Proving bisimilarity for context-free processes. Journal of Logic and Computation 8(4), 485–509 (1998)
Milner, R.: A complete inference system for a class of regular behaviours. Journal of Computer ans System Sciences 28, 439–466 (1984)
Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)
Srba, J.: Strong Bisimilarity and Regularity of Basic Process Algebra is PSPACE-Hard. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 716–727. Springer, Heidelberg (2002)
Srba, J.: Roadmap of Infinite Results. Bulletin of the European Association for Theoretical Computer Science, columns: Concurrency 78, 163–175 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luo, L. (2008). Deciding Bisimilarity of Full BPA Processes Locally. In: Cha, S.(., Choi, JY., Kim, M., Lee, I., Viswanathan, M. (eds) Automated Technology for Verification and Analysis. ATVA 2008. Lecture Notes in Computer Science, vol 5311. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88387-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-88387-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88386-9
Online ISBN: 978-3-540-88387-6
eBook Packages: Computer ScienceComputer Science (R0)