Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2013: Automata, Languages, and Programming pp 238–249Cite as

Checking Equality and Regularity for Normed BPA with Silent Moves

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7966))

Abstract

The decidability of weak bisimilarity on normed BPA is a long standing open problem. It is proved in this paper that branching bisimilarity, a standard refinement of weak bisimilarity, is decidable for normed BPA and that the associated regularity problem is also decidable.

The full paper can be found at http://basics.sjtu.edu.cn/~yuxi/ .

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baeten, J., Bergstra, J., Klop, J.: Decidability of bisimulation equivalence for processes 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)

    Chapter  Google Scholar 

  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, pp. 423–433. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  3. Burkart, O., Caucal, D., Steffen, B.: Bisimulation collapse and the process taxonomy. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 247–262. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  4. Balcazar, J., Gabarro, J., Santha, M.: Deciding bisimilarity is p-complete. Formal Aspects of Computing 4, 638–648 (1992)

    Article  MATH  Google Scholar 

  5. Czerwiński, W., Hofman, P., Lasota, S.: Decidability of branching bisimulation on normed commutative context-free processes. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 528–542. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. 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, pp. 138–147. Springer, Heidelberg (1992)

    Google Scholar 

  7. Caucal, D., Huynh, D., Tian, L.: Deciding branching bisimilarity of normed context-free processes is in \(\sigma^p_2\). Information and Computation 118, 306–315 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hirshfeld, Y.: Bisimulation trees and the decidability of weak bisimulations. Electronic Notes in Theoretical Computer Science 5, 2–13 (1996)

    Article  Google Scholar 

  9. Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context free processes. Theoretical Computer Science 158(1-2), 143–159 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hüttel, H., Stirling, C.: Actions speak louder than words: Proving bisimilarity for context-free processes. In: LICS 1991, pp. 376–386 (1991)

    Google Scholar 

  11. Huynh, T., Tian, L.: Deciding bisimilarity of normed context free processes is in \(\sigma_{2}^{p}\). Theoretical Computer Science 123, 83–197 (1994)

    Article  MathSciNet  Google Scholar 

  12. Hüttel, H.: Silence is golden: Branching bisimilarity is decidable for context free processes. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 2–12. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  13. Jančar, P.: Bisimilarity on basic process algebra is in 2-exptime (2012)

    Google Scholar 

  14. Jančar, P., Esparza, J.: Deciding finiteness of petri nets up to bisimulation. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 478–489. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  15. Kiefer, S.: BPA bisimilarity is exptime-hard. Information Processing Letters 113, 101–106 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kučera, A.: Regularity is decidable for normed BPA and normed BPP processes in polynomial time. In: Král, J., Bartosek, M., Jeffery, K. (eds.) SOFSEM 1996. LNCS, vol. 1175, pp. 377–384. Springer, Heidelberg (1996)

    Google Scholar 

  17. Mayr, R.: Process rewrite systems. Information and Computation 156, 264–286 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Mayr, R.: Weak bisimilarity and regularity of BPA is exptime-hard. In: EXPRESS 2003 (2003)

    Google Scholar 

  19. 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)

    Chapter  Google Scholar 

  20. Srba, J.: Complexity of weak bisimilarity and regularity for BPA and BPP. Mathematical Structures in Computer Science 13, 567–587 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  21. Stříbrná, J.: Hardness results for weak bisimilarity of simple process algebras. Electronic Notes in Theoretical Computer Science 18, 179–190 (1998)

    Article  Google Scholar 

  22. van Glabbeek, R., Weijland, W.: Branching time and abstraction in bisimulation semantics. In: Information Processing 1989, pp. 613–618. North-Holland (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BASICS, Department of Computer Science, MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems, Shanghai Jiao Tong University, China

    Yuxi Fu

Authors
  1. Yuxi Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, Postboks 7803, 5020, Bergen, Norway

    Fedor V. Fomin

  2. Faculty of Computing, University of Latvia, Raina bulv. 19, 1586, Riga, Latvia

    Rūsiņš Freivalds

  3. Department of Computer Science, Wolfson Building, Parks Road, University of Oxford, OX1 3QD, Oxford, UK

    Marta Kwiatkowska

  4. Faculty of Mathematics and Computer Science, Weizmann Institute of Science, POB 26, 76100, Rehovot, Israel

    David Peleg

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fu, Y. (2013). Checking Equality and Regularity for Normed BPA with Silent Moves. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39212-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39212-2_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39211-5

  • Online ISBN: 978-3-642-39212-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation