Reachability analysis of mobile ambients in fragments of AC term rewriting

Authors:
Giorgio Delzanno;Roberto Montagna
Affiliations:
Dipartimento di Informatica e Scienze dell’Informazione, Università di Genova, Genova, Italy;Dipartimento di Informatica e Scienze dell’Informazione, Università di Genova, Genova, Italy
Venue:
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Year:
2006

Citing 11
Cited 0

Deterministic tree pushdown automata and monadic tree rewriting systems

Journal of Computer and System Sciences
Process rewrite systems

Information and Computation - Special issue on EXPRESS 1997
Mobile ambients

Theoretical Computer Science
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Boxed Ambients

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Decidable Approximations of Term Rewriting Systems

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Bottom-Up Tree Pushdown Automata and Rewrite Systems

RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
On the computational strength of pure ambient calculi

Theoretical Computer Science - Expressiveness in concurrency
When ambients cannot be opened

Theoretical Computer Science - Foundations of software science and computation structures
Reachability analysis in boxed ambients

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Deciding reachability in mobile ambients

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

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.