Deciding Reachability in Mobile Ambients with Name Restriction | Zendy

Giorgio Delzanno | Zendy; Roberto Montagna | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Deciding Reachability in Mobile Ambients with Name Restriction

Author(s) -

Giorgio Delzanno,

Roberto Montagna

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2009.05.027

Subject(s) - reachability , decidability , fragment (logic) , computer science , commutative property , rewriting , associative property , mathematics , computation , reachability problem , semantics (computer science) , discrete mathematics , theoretical computer science , algorithm , programming language , pure mathematics

We investigate the reachability problem for fragments of the Mobile Ambients, a powerful model for distributed and mobile computation. By using a connection with associative-commutative term rewriting, we prove that reachability is decidable in the open-free fragment of pure Mobile Ambients with name restriction and weak reduction semantics. Processes in this model have three sources of infiniteness: depth of ambients, width of parallel composition, and number of restricted names. Our work extends similar results obtained for public fragments of Mobile Ambients

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research