Decidability of behavioral equivalences in process calculi with name scoping

  • Authors:

  • Chaodong He;Yuxi Fu;Hongfei Fu

  • Affiliations:

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

  • Venue:
  • FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Local channels and their name scoping rules play a significant role in the study of the expressiveness of process calculi. The paper contributes to the understanding of the expressiveness in the context of CCS by studying the decidability issues of the bisimilarity/similarity checking problems. The strong bisimilarity for a pair of processes in the calculi with only static local channels is shown Π01-complete. The strong bisimilarity between those processes and the finite state processes is proved decidable. The strong similarity between the finite state processes and the processes without name-passing capability is also shown decidable.