Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: characteristic formulas

Sortuj według:

Ogranicz wyniki do:

Separability, Expressiveness, and Decidability in the Ambient Logic

Hirschkoff D.

Schedae Informaticae

2003

Vol. 12

77-84

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 synIF , respectively defined by imposing a semantic and a syntactic constraint on process prefixes. The main contributions include: coinductive and inductive operational characterisations of = L on MA synIF; an axiomatisation of = L on MA IF ; the construction of characteristic formulas for the processes in with respect to = L; the decidability of = L on MA IF and on MAsynIF , and its undecidability on MA.