Skip to main content
SpringerLink
Log in

Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting

  • Conference paper
Theoretical Aspects of Computing - ICTAC 2006 (ICTAC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4281))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boneva, I., Talbot, J.-M.: When Ambients cannot be Opened? Theoretical Computer Science 333(1-2), 127–169 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  4. Busi, N., Zavattaro, G.: Deciding Reachability in Boxed Ambients. In: Proc. of ICTCS 2005, pp. 143–159 (2005)

    Google Scholar 

  5. Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science 240(1), 177–213 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  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. Dauchet, M., Tison, S.: The Theory of Ground Rewrite Systems is Decidable. In: Proc. of LICS 1990, pp. 242–248 (1990)

    Google Scholar 

  8. Feuillade, G., Genet, T., Viet Triem Tong, V.: Reachability Analysis over Term Rewriting Systems. Theoretical Computer Science 330(3), 501–551 (2005)

    Article  MathSciNet  Google Scholar 

  9. Jacquemard, F.: Decidable Approximations of Term Rewriting Systems. In: Proc. RTA 1996, pp. 362–376 (1996)

    Google Scholar 

  10. Levi, F., Sangiorgi, D.: Mobile Safe Ambients. ACM Transactions on Programming Languages and Systems 25(1), 1–69 (2003)

    Article  Google Scholar 

  11. Maffeis, S., Phillips, I.: On the Computational Strength of Pure Ambient Calculi. Theoretical Computer Science 330(3), 501–551 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal of Computing (1984)

    Google Scholar 

  13. Mayr, R., Rusinowitch, M.: Reachability is Decidable for Ground AC Rewrite Systems. In: Proc. of Infinity 1998 (1998)

    Google Scholar 

  14. Mayr, R.: Process Rewrite Systems. Information and Computation 156(1-2), 264–286 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Salomaa, K.: Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. Journal of Computer Systems Science 37(3), 367–394 (1988)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Giorgio Delzanno & Roberto Montagna

Authors
  1. Giorgio Delzanno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Montagna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, 192 rue Saint Martin, Paris Cedex 03, France

    Kamel Barkaoui

  2. Department of Computer Science, University of York, York, UK

    Ana Cavalcanti

  3. UNU-IIST, Macau SAR, China

    Antonio Cerone

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delzanno, G., Montagna, R. (2006). Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting. In: Barkaoui, K., Cavalcanti, A., Cerone, A. (eds) Theoretical Aspects of Computing - ICTAC 2006. ICTAC 2006. Lecture Notes in Computer Science, vol 4281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11921240_21

Download citation

  • DOI: https://doi.org/10.1007/11921240_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48815-6

  • Online ISBN: 978-3-540-48816-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation