{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:35:56Z","timestamp":1753889756180,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2008,9,4]],"date-time":"2008-09-04T00:00:00Z","timestamp":1220486400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The \\it{Ambient Logic} (AL) has been proposed for expressing properties of\nprocess mobility in the calculus of Mobile Ambients (MA), and as a basis for\nquery languages on semistructured data. We study some basic questions\nconcerning the discriminating power of AL, focusing on the equivalence on\nprocesses induced by the logic $(=_L&gt;)$. As underlying calculi besides MA we\nconsider a subcalculus in which an image-finiteness condition holds and that we\nprove to be Turing complete. Synchronous variants of these calculi are studied\nas well. In these calculi, we provide two operational characterisations of\n$_=L$: a coinductive one (as a form of bisimilarity) and an inductive one\n(based on structual properties of processes). After showing $_=L$ to be stricly\nfiner than barbed congruence, we establish axiomatisations of $_=L$ on the\nsubcalculus of MA (both the asynchronous and the synchronous version), enabling\nus to relate $_=L$ to structural congruence. We also present some\n(un)decidability results that are related to the above separation properties\nfor AL: the undecidability of $_=L$ on MA and its decidability on the\nsubcalculus.<\/jats:p>","DOI":"10.2168\/lmcs-4(3:4)2008","type":"journal-article","created":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T10:21:12Z","timestamp":1231496472000},"source":"Crossref","is-referenced-by-count":1,"title":["Separability in the Ambient Logic"],"prefix":"10.46298","volume":"Volume 4, Issue 3","author":[{"given":"Daniel","family":"Hirschkoff","sequence":"first","affiliation":[]},{"given":"Etienne","family":"Lozes","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Sangiorgi","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2008,9,4]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/682\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/682\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:53:49Z","timestamp":1681242829000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,4]]},"references-count":0,"URL":"https:\/\/doi.org\/10.2168\/lmcs-4(3:4)2008","relation":{"is-same-as":[{"id-type":"arxiv","id":"0806.3849","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.0806.3849","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2008,9,4]]},"article-number":"682"}}