More on bisimulations for higher order π-calculus

  • Authors:
  • Zining Cao

  • Affiliations:
  • -

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2012

Quantified Score

Hi-index 5.23

Visualization

Abstract

In this paper, we prove the coincidence between strong/weak context bisimulation and strong/weak normal bisimulation for higher order @p-calculus, which generalizes Sangiorgi's work. To achieve this aim, we introduce indexed higher order @p-calculus, which is similar to higher order @p-calculus except that every prefix of any process is assigned indices. Furthermore we present corresponding indexed bisimulations for this calculus, and prove the equivalence between these indexed bisimulations. Based on this result, we prove the main result of this paper, i.e., the equivalence between strong/weak context bisimulation and strong/weak normal bisimulation.