Reachability analysis of fragments of mobile ambients in AC term rewriting

Authors:
Giorgio Delzanno;Roberto Montagna
Affiliations:
Università di Genova, Dipartimento di Informatica e Scienze dell’Informazione, via Dodecaneso 35, 16143, Genova, Italy;Università di Genova, Dipartimento di Informatica e Scienze dell’Informazione, via Dodecaneso 35, 16143, Genova, Italy
Venue:
Formal Aspects of Computing
Year:
2008

Citing 0
Cited 2

Deciding Reachability in Mobile Ambients with Name Restriction

Electronic Notes in Theoretical Computer Science (ENTCS)
Multiset rewriting for the verification of depth-bounded processes with name binding

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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.