The Complexity of Model Checking Mobile Ambients [chapter]

Witold Charatonik, Silvano Dal Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
2001 Lecture Notes in Computer Science  
We settle the complexity bounds of the model checking problem for the replication-free ambient calculus with public names against the ambient logic without parallel adjunct. We show 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 PSPACEhardness of the problem for several quite simple
more » ... fragments of the calculus and the logic; this suggests that there are no interesting fragments with polynomial-time model checking algorithms.
doi:10.1007/3-540-45315-6_10 fatcat:c7ntdwvsorel3cd2ythclgnxli