Decidable Fragments of a Higher Order Calculus with Locations

DOI10.1016/j.entcs.2009.06.016zbMath1291.68283OpenAlexW2043493308MaRDI QIDQ5170669

Mikkel Bundgaard, Jens Chr. Godskesen, Hans Hüttel, Bjørn Haagensen

Publication date: 23 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.06.016

zbMATH Keywords

decidabilitylocationshigher-order process passingsemantic finite control

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (2)

On the expressiveness and decidability of higher-order process calculi ⋮ On the interactive power of higher-order processes extended with parameterization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of communicating systems
• Plain CHOCS. A second generation calculus for higher order processes
• On the decidability of process equivalences for the \(\pi\)-calculus
• Mobile ambients
• On the computational strength of pure ambient calculi
• On the expressive power of movement and restriction in pure mobile ambients
• A CPS encoding of name-passing in higher-order mobile embedded resources
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Decidable Fragments of a Higher Order Calculus with Locations