Advertisement

Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes

  • Wojciech Czerwiński
  • Piotr Hofman
  • Sławomir Lasota
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6901)

Abstract

We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the small response property: in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoiler’s process. The linear bound is effective, which leads to decidability of branching bisimilarity. For weak bisimilarity, we are able merely to show existence of some linear bound, which is not sufficient for decidability. We conjecture however that the same effective bound holds for weak bisimilarity as well. We believe that further elaboration of novel techniques developed in this paper may be sufficient to demonstrate decidability.

Keywords

Normal Form Winning Strategy Norm Preserve Silent Transition Variable Occurrence 
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.
    Christensen, S.: Decidability and Decomposition in process algebras. PhD thesis, Dept. of Computer Science, University of Edinburgh, UK (1993)Google Scholar
  2. 2.
    Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation equivalence is decidable for Basic Parallel Processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 143–157. Springer, Heidelberg (1993)Google Scholar
  3. 3.
    Esparza, J.: Petri nets, commutative context-free grammars, and Basic Parallel Processes. Fundam. Inform. 31(1), 13–25 (1997)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Fröschle, S., Lasota, S.: Normed processes, unique decomposition, and complexity of bisimulation equivalences. Electr. Notes Theor. Comp. Sci. 239, 17–42 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Hirshfeld, Y.: Congruences in commutative semigroups. Technical report, University of Edinburgh, LFCS report ECS-LFCS-94-291 (1994)Google Scholar
  6. 6.
    Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes. Mathematical Structures in Computer Science 6(3), 251–259 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Jancar, P.: Decidability questions for bismilarity of Petri nets and some related problems. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 581–592. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  8. 8.
    Jancar, P.: Strong bisimilarity on Basic Parallel Processes is PSPACE-complete. In: LICS, pp. 218–227 (2003)Google Scholar
  9. 9.
    Lasota, S.: Decidability of performance equivalence for Basic Parallel Processes. Theoretical Computer Science 360, 172–192 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1995)Google Scholar
  11. 11.
    Srba, J.: Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 535–546. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. 12.
    Srba, J.: Roadmap of Infinite results. Formal Models and Semantics, vol. 2. World Scientific Publishing Co., Singapore (2004)Google Scholar
  13. 13.
    Stirling, C.: The joys of bisimulation. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 142–151. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  14. 14.
    Stirling, C.: Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 379–393. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Wojciech Czerwiński
    • 1
  • Piotr Hofman
    • 1
  • Sławomir Lasota
    • 1
  1. 1.Institute of InformaticsUniversity of WarsawPoland

Personalised recommendations