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.
More on bisimulations for higher order π-calculus
Published 2012 in Theoretical Computer Science
ABSTRACT
PUBLICATION RECORD
- Publication year
2012
- Venue
Theoretical Computer Science
- Publication date
2012-08-01
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-28 of 28 references · Page 1 of 1
CITED BY
Showing 1-11 of 11 citing papers · Page 1 of 1