Model checking mobile ambients
โ
Witold Charatonik; Silvano Dal Zilio; Andrew D. Gordon; Supratik Mukhopadhyay; J
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 789 KB
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 c