2005/10/31 by Daniel Hirschkoff, Étienne Lozes, Etienne Lozes +1 · 16 citations
Computer Science · Mathematics · #Advanced Database Systems and Queries #Algebra over a field #Algorithm #Basis (linear algebra) #Calculus (dental) #Computer science #Discrete mathematics #Distributed systems and fault tolerance #Equivalence (formal languages) #Logic, Reasoning, and Knowledge #Mathematics #Process (computing) #Process calculus #Programming language #Pure mathematics #Term (time) #Theoretical computer science #cs.LO
paper · pdf · doi:10.2168/lmcs-2(2:3)2006
published in Logical Methods in Computer Science Volume 2, Issue 2 (Logical Methods in Computer Science e.V.)
arxiv created 2006/03/30 · openalex publication_date 2006/03/30 · arxiv updated 2017/01/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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. In this paper, we study the expressiveness of AL. We define formulas for capabilities and for communication in MA. We also derive some formulas that capture finitess of a term, name occurrences and persistence. We study extensions of the calculus involving more complex forms of communications, and we define characteristic formulas for the equivalence induced by the logic on a subcalculus of MA. This subcalculus is defined by imposing an image-finiteness condition on the reducts of a MA process.