Ghelli, Giorgio and Conforti, Giovanni (2003) Decidability of Freshness, Undecidability of Revelation. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (279Kb) |
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.
Item Type: | Book |
---|---|
Uncontrolled Keywords: | Spatial Logic, Decidability, Extrusion, Freshness, Revelation, Hiding |
Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | dott.ssa Sandra Faita |
Date Deposited: | 17 Dec 2014 16:37 |
Last Modified: | 17 Dec 2014 16:37 |
URI: | http://eprints.adm.unipi.it/id/eprint/2100 |
Repository staff only actions
View Item |