2006 | OriginalPaper | Buchkapitel
More on Bisimulations for Higher Order π-Calculus
verfasst von : Zining Cao
Erschienen in: Foundations of Software Science and Computation Structures
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we prove the coincidence between strong/weak context bisimulation and strong/weak normal bisimulation for higher order
π
-calculus, which generalizes Sangiorgi’s work. To achieve this aim, we introduce indexed higher order
π
-calculus, which is similar to higher order
π
-calculus except that every prefix of any process is assigned to indices. Furthermore we present corresponding indexed bisimulations for this calculus, and prove the equivalence between these indexed bisimulations. As an application of this result, we prove the equivalence between strong/weak context bisimulation and strong/weak normal bisimulation.