Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting

  • Giorgio Delzanno
  • Roberto Montagna
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4281)


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.


Internal Node Reduction Rule Reachability Analysis Ground Term Tree Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boneva, I., Talbot, J.-M.: When Ambients cannot be Opened? Theoretical Computer Science 333(1-2), 127–169 (2005)CrossRefMathSciNetMATHGoogle Scholar
  2. 2.
    Bugliesi, M., Castagna, G., Crafa, S.: Boxed Ambients. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 38–63. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Busi, N., Zavattaro, G.: Deciding Reachability in Mobile Ambients. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 248–262. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Busi, N., Zavattaro, G.: Deciding Reachability in Boxed Ambients. In: Proc. of ICTCS 2005, pp. 143–159 (2005)Google Scholar
  5. 5.
    Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science 240(1), 177–213 (2000)CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    Coquidé, J.-L., Dauchet, M., Gilleron, R., Vágvölgyi, S.: Bottom-Up Tree Pushdown Automata and Rewrite Systems. In: Proc. of RTA 1991, pp. 287–298 (1991)Google Scholar
  7. 7.
    Dauchet, M., Tison, S.: The Theory of Ground Rewrite Systems is Decidable. In: Proc. of LICS 1990, pp. 242–248 (1990)Google Scholar
  8. 8.
    Feuillade, G., Genet, T., Viet Triem Tong, V.: Reachability Analysis over Term Rewriting Systems. Theoretical Computer Science 330(3), 501–551 (2005)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Jacquemard, F.: Decidable Approximations of Term Rewriting Systems. In: Proc. RTA 1996, pp. 362–376 (1996)Google Scholar
  10. 10.
    Levi, F., Sangiorgi, D.: Mobile Safe Ambients. ACM Transactions on Programming Languages and Systems 25(1), 1–69 (2003)CrossRefGoogle Scholar
  11. 11.
    Maffeis, S., Phillips, I.: On the Computational Strength of Pure Ambient Calculi. Theoretical Computer Science 330(3), 501–551 (2005)CrossRefMathSciNetMATHGoogle Scholar
  12. 12.
    Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal of Computing (1984)Google Scholar
  13. 13.
    Mayr, R., Rusinowitch, M.: Reachability is Decidable for Ground AC Rewrite Systems. In: Proc. of Infinity 1998 (1998)Google Scholar
  14. 14.
    Mayr, R.: Process Rewrite Systems. Information and Computation 156(1-2), 264–286 (2000)CrossRefMathSciNetMATHGoogle Scholar
  15. 15.
    Salomaa, K.: Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. Journal of Computer Systems Science 37(3), 367–394 (1988)CrossRefMathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Giorgio Delzanno
    • 1
  • Roberto Montagna
    • 1
  1. 1.Dipartimento di Informatica e Scienze dell’InformazioneUniversità di GenovaGenovaItaly

Personalised recommendations