User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Journal Article

Model checking mobile ambients


Charatonik,  Witold
Programming Logics, MPI for Informatics, Max Planck Society;


Mukhopadhyay,  Supratik
Programming Logics, MPI for Informatics, Max Planck Society;


Talbot,  Jean-Marc
Programming Logics, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Charatonik, W., Dal Zilio, S., Gordon, A. D., Mukhopadhyay, S., & Talbot, J.-M. (2003). Model checking mobile ambients. Theoretical Computer Science, 308, 277-331.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2D77-D
We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replication-free calculus and guarantee-free logic we prove that the problem is PSPACE-complete. For the complexity upper-bound, we devise a new representation of processes that remains of polynomial size during process execution; this allows us to keep the model checking procedure in polynomial space. Moreover, we prove PSPACE-hardness of the problem for several quite simple fragments of the calculus and the logic; this suggests that there are no interesting fragments with polynomial-time model checking algorithms.