Advertisement

Deciding Bisimilarity of Full BPA Processes Locally

  • Lingyun Luo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5311)

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.

Keywords

Basic Step Equational Theory Operational Semantic Label Transition System Fresh Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Caucal, D.: Graphes canoniques de graphes algébriques. Informatique Théorique et Applications(RAIRO) 24(4), 339–352 (1990)MathSciNetzbMATHGoogle Scholar
  4. 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
  5. 5.
    Groote, J.F.: A short proof of the decidability of bisimulation for normed bpa-processes. Inform. process. lett. 42, 167–171 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimulation of normed context-free processes. Theoretical Computer Science 15, 143–159 (1996)CrossRefzbMATHGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 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
  9. 9.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Milner, R.: A complete inference system for a class of regular behaviours. Journal of Computer ans System Sciences 28, 439–466 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)zbMATHGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Srba, J.: Roadmap of Infinite Results. Bulletin of the European Association for Theoretical Computer Science, columns: Concurrency 78, 163–175 (2002)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Lingyun Luo
    • 1
    • 2
  1. 1.Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesBeijingChina
  2. 2.Graduate School of the Chinese Academy of SciencesChina

Personalised recommendations