Abstract
The decidability of reachability for pure public Mobile Ambients (i.e. without communication and restriction) has been recently investigated in [5], where a characterization of a maximal deacidable fragment is provided. A peculiar feature of such a fragment is the absence of the open capability for ambient dissolution. In this paper we analyse reachability in Boxed Ambients [2], the most relevant variant of Mobile Ambients in which the open capability is dropped and replaced by a sophisticated parent/child form of communication.
The main novelties with respect to [5] are: (i) the definition of a more general notion of reachability (called target reachability); (ii) the proof of the decidability of target reachability for a richer calculus also comprising parent/child communication.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boneva, I., Talbot, J.-M.: When Ambients Cannot be Opened. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 169–184. Springer, Heidelberg (2003)
Bugliesi, M., Castagna, G., Crafa, S.: Access Control for Mobile Agents: The Calculus of Boxed Ambients. ACM Transactions on Programming Languages and Systems 26(1), 57–124 (2004)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.: Communication and Mobility Control in Boxed Ambients. To appear in the Journal of Information & Computation
Busi, N., Zavattaro, G.: On the Expressive Power of Movement and Restriction in Pure Mobile Ambients. In: Theoretical Computer Science, vol. 322, pp. 477–515. Elsevier, Amsterdam (2004)
Busi, N., Zavattaro, G.: Deciding Reachability in Mobile Ambients. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 248–262. Springer, Heidelberg (2005)
Busi, N., Zavattaro, G.: Deciding Reachability in Mobile Ambients - Extended version. Available at http://www.cs.unibo.it/~busi/papers/MA05.pdf
Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science 240(1), 177–213 (2000)
Maffeis, S., Phillips, I.: On the Computational Strength of Pure Mobile Ambients. To appear in Theoretical Computer Science
Regev, A., Panina, E.M., Silverman, W., Cardelli, L., Shapiro, E.: BioAmbients: An Abstraction for Biological Compartments. Theoretical Computer Science 325(1), 141–167 (2004)
Reutenauer, C.: The Mathematics of Petri Nets. Masson (1988)
Reisig, W.: Petri nets: An Introduction. In: EATCS Monographs in Computer Science. Springer, Heidelberg (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busi, N., Zavattaro, G. (2005). Reachability Analysis in Boxed Ambients. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_12
Download citation
DOI: https://doi.org/10.1007/11560586_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29106-0
Online ISBN: 978-3-540-32024-1
eBook Packages: Computer ScienceComputer Science (R0)