Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
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.
KeywordsNormal Form Winning Strategy Norm Preserve Silent Transition Variable Occurrence
Unable to display preview. Download preview PDF.
- 1.Christensen, S.: Decidability and Decomposition in process algebras. PhD thesis, Dept. of Computer Science, University of Edinburgh, UK (1993)Google Scholar
- 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
- 5.Hirshfeld, Y.: Congruences in commutative semigroups. Technical report, University of Edinburgh, LFCS report ECS-LFCS-94-291 (1994)Google Scholar
- 8.Jancar, P.: Strong bisimilarity on Basic Parallel Processes is PSPACE-complete. In: LICS, pp. 218–227 (2003)Google Scholar
- 10.Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1995)Google Scholar
- 12.Srba, J.: Roadmap of Infinite results. Formal Models and Semantics, vol. 2. World Scientific Publishing Co., Singapore (2004)Google Scholar