Reachability analysis of fragments of mobile ambients in AC term rewriting-Reference-Cited by-同舟云学术

Reachability analysis of fragments of mobile ambients in AC term rewriting

Published:2008-07 Issue:4-5 Volume:20 Page:407-428
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Delzanno Giorgio¹,Montagna Roberto¹

Affiliation:

1. Dipartimento di Informatica e Scienze dell’Informazione, Università di Genova, via Dodecaneso 35, 16143, Genova, Italy

Abstract

Abstract In this paper, we investigate the connection between fragments of associative-commutative Term Rewriting and fragments of Mobile Ambients, a powerful model for mobile and distributed computations. The connection can be used to transfer decidability and undecidability results for important computational properties like reachability from one formalism to the other. Furthermore, it can be viewed as a vehicle to apply tools based on rewriting for the simulation and validation of specifications given in Mobile Ambients.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-008-0081-8.pdf

Reference18 articles.

1. When ambients cannot be opened

2. Bugliesi M Castagna G Crafa S (2001) Boxed ambients. In: Proceeding of TACS 2001 pp 38–63

3. Busi N Zavattaro G (2005) Deciding reachability in mobile ambients. In: Proceedings of ESOP 2005 pp 248–262

4. Busi N Zavattaro G (2005) Deciding reachability in boxed ambients. In: Proceedings of ICTCS 2005 pp 143–159

5. Mobile ambients

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multiset rewriting for the verification of depth-bounded processes with name binding;Information and Computation;2012-06

2. Deciding Reachability in Mobile Ambients with Name Restriction;Electronic Notes in Theoretical Computer Science;2009-07