Decidable Fragments of a Higher Order Calculus with Locations

https://doi.org/10.1016/j.entcs.2009.06.016Get rights and content
Under a Creative Commons license
open access

Abstract

Homer is a higher order process calculus with locations. In this paper we study Homer in the setting of the semantic finite control property, which is a finite reachability criterion that implies decidability of barbed bisimilarity. We show that strong and weak barbed bisimilarity are undecidable for Homer. We then identify and compare two distinct subcalculi of Homer that both satisfy the semantic finite control property. One subcalculus is obtained by using a type system bounding the size of process terms. The other subcalculus is obtained by considering the image of the encoding of the finite control π-calculus in Homer.

Keywords

Decidability
higher order process passing
locations
semantic finite control

Cited by (0)

1

Supported by grant no. 274-06-0415 and 2059-03-0031 from the Danish Research Council for Technology and Production and the IT University of Copenhagen (the CosmoBiz and BPL projects).

2

Supported by grant no. 272-05-0258 from the Danish Research Agency.