Decidable Fragments of a Higher Order Calculus with Locations

Authors:
Mikkel Bundgaard;Jens Chr. Godskesen;Bjørn Haagensen;Hans Hüttel
Affiliations:
The Programming, Logic, and Semantics group, IT University of Copenhagen, Denmark;The Programming, Logic, and Semantics group, IT University of Copenhagen, Denmark;Department of Computer Science, Aalborg University, Denmark;Department of Computer Science, Aalborg University, Denmark
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 13
Cited 2

On the decidability of process equivalences for the &pgr;-calculus

Theoretical Computer Science - Special issue on algebraic methodology and software technology
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Mobile ambients

Theoretical Computer Science
A Calculus of Communicating Systems

A Calculus of Communicating Systems
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Finite-Control Mobile Ambients

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
On the expressiveness of pure safe ambients

Mathematical Structures in Computer Science
On the expressive power of movement and restriction in pure mobile ambients

Theoretical Computer Science - Special issue: Foundations of wide area network computing
On the computational strength of pure ambient calculi

Theoretical Computer Science - Expressiveness in concurrency
Computation: finite and infinite machines

Computation: finite and infinite machines
A CPS encoding of name-passing in higher-order mobile embedded resources

Theoretical Computer Science - Expressiveness in concurrency
On the Expressiveness and Decidability of Higher-Order Process Calculi

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Extending howe's method to early bisimulations for typed mobile embedded resources with local names

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

On the Expressiveness of Forwarding in Higher-Order Communication

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the expressiveness and decidability of higher-order process calculi

Information and Computation

Quantified Score

Hi-index	0.01

Visualization

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 @p-calculus in Homer.