Sciweavers

FSTTCS
2005
Springer

Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names

14 years 5 months ago
Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names
We extend Howe’s method to prove that input-early strong and -delay contextual bisimulations are congruences for the Higher-order mobile embedded resources (Homer) calculus, a typed higher order process calculus with active mobile processes, nested locations and local names which conservatively extends the syntax and semantics of higher-order calculi such as Plain CHOCS and HOpi. We prove that the input-early strong and -delay contextual bisimulation congruences are sound co-inductive characterisations of barbed bisimulation congruence and in fact complete in the strong case. The extension of Howe’s method provides considerably simpler congruence proofs than established previously for similar calculi for mobile processes in nested locations.
Jens Chr. Godskesen, Thomas T. Hildebrandt
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where FSTTCS
Authors Jens Chr. Godskesen, Thomas T. Hildebrandt
Comments (0)