Deciding validity in a spatial logic for trees
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Model checking mobile ambients
Theoretical 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
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Elimination of spatial connectives in static spatial logics
Theoretical Computer Science - Expressiveness in concurrency
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Deciding validity in a spatial logic for trees
Journal of Functional Programming
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Elimination of quantifiers and undecidability in spatial logics for concurrency
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A coordination approach to mobile components
Theoretical Computer Science - Formal methods for components and objects
When ambients cannot be opened
Theoretical Computer Science - Foundations of software science and computation structures
Theoretical Computer Science
An Observational Model for Spatial Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
When ambients cannot be opened
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
On the relationship between spatial logics and behavioral simulations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data.We study some basic questions concerning the descriptive and discriminating power of AL, focusing on the equivalence on processes induced by the logic (=L). We consider MA, and two Turing complete subsets of it, MA_{IF} and MA_{IF}^{syn}, respectively defined by imposing a semantic and a syntactic constraint on process prefixes.The main contributions include: coinductive and inductive operational characterisations of =L; an axiomatisation of =L on MA_{IF}^{syn}; the construction of characteristic formulas for the processes in MA_{IF} with respect to =L; the decidability of =L on MA_{IF} and on MA_{IF}^{syn}, and its undecidability on MA.