Decidability of Freshness, Undecidability of Revelation

Abstract

Abstract. We study decidability of a logic for describing processes with restricted names. We choose a minimal fragment of the Ambient Logic, but the techniques we present should apply to every logic which uses Cardelli and Gordon revelation and hiding operators, and Gabbay and Pitts freshness quantifier. We start from the static fragment of ambient logic that Calcagno, Cardelli and Gordon proved to be decidable. We prove that the addition of a hiding quantifier makes the logic undecidable. Hiding can be decomposed as freshness plus revelation. Quite surprisingly, freshness alone is decidable, but revelation alone is not.

Deciding validity in a spatial logic for trees

“…A prerequisite of studying these operators would be to enrich our tree model with fresh names. • Conforti & Ghelli (2004) study decidability for fragments of ambient logic with various restrictions on the use of quantifiers. The decidability proofs are based on the techniques described in this paper.…”

An Extensional Spatial Logic for Mobile Processes

“…(the second formula is from [CG01b] -note that in the static case, free(n) can be defined using only [CG04]). Having the ability to observe under restrictions, we can define a modality formula for bound output:…”