## The decidability of model checking mobile ambients (2001)

Venue: | In Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic, volume 2142 of LNCS |

Citations: | 36 - 6 self |

### BibTeX

@INPROCEEDINGS{Charatonik01thedecidability,

author = {Witold Charatonik},

title = {The decidability of model checking mobile ambients},

booktitle = {In Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic, volume 2142 of LNCS},

year = {2001},

pages = {339--354},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

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.

### Citations

809 | Mobile Ambients - Cardelli, Gordon - 1998 |

162 | Anytime, anywhere. Modal logics for mobile ambients - Cardelli, Gordon - 2000 |

155 | Mobility types for mobile ambients - Cardelli, Ghelli, et al. - 1999 |

136 | A spatial logic for concurrency (part I
- Caires, Cardelli
- 2001
(Show Context)
Citation Context ... spatial structure, such as a system of ambients. Apart from the ambient logic, other examples include logics for concurrent objects [4], heaps [25, 20, 22], trees [6], graphs [5], and the π-calculus =-=[2, 3]-=-. Spatial logics are being applied as notations for specifying and verifying programs, and as query languages for semistructured data. The results of this paper apply directly only to the ambient logi... |

117 | Recursively enumerable sets of positive integers and their decision problems - Post - 1944 |

62 | A Query Language Based on the Ambient Logic - Cardelli, Ghelli - 2004 |

61 | A spatial logic for querying graphs
- Cardelli, Gardner, et al.
(Show Context)
Citation Context ...f a formula depends on a spatial structure, such as a system of ambients. Apart from the ambient logic, other examples include logics for concurrent objects [4], heaps [25, 20, 22], trees [6], graphs =-=[5]-=-, and the π-calculus [2, 3]. Spatial logics are being applied as notations for specifying and verifying programs, and as query languages for semistructured data. The results of this paper apply direct... |

57 | Equational properties for mobile ambients - Cardelli, Gordon - 1999 |

55 | A spatial logic for concurrency (part II
- Caires, Cardelli
- 2002
(Show Context)
Citation Context ... spatial structure, such as a system of ambients. Apart from the ambient logic, other examples include logics for concurrent objects [4], heaps [25, 20, 22], trees [6], graphs [5], and the π-calculus =-=[2, 3]-=-. Spatial logics are being applied as notations for specifying and verifying programs, and as query languages for semistructured data. The results of this paper apply directly only to the ambient logi... |

50 | The impossibility of an algorithm for the decision problem for finite models - Trakhtenbrot - 1950 |

46 | Logical properties of name restriction - Cardelli, Gordon - 2001 |

41 | Extensionality and Intensionality of the Ambient Logics - Sangiorgi - 2001 |

9 | Verifiable and Executable Logic Specifications of Concurrent Objects in π
- Caires, Monteiro
- 1998
(Show Context)
Citation Context ...n recently. In a spatial logic, the truth of a formula depends on a spatial structure, such as a system of ambients. Apart from the ambient logic, other examples include logics for concurrent objects =-=[4]-=-, heaps [25, 20, 22], trees [6], graphs [5], and the π-calculus [2, 3]. Spatial logics are being applied as notations for specifying and verifying programs, and as query languages for semistructured d... |

7 | The complexity of model checking mobile ambients - Charatonik, Dal-Zilio, et al. - 2001 |

5 |
On the expressiveness of movement in pure mobile ambients
- Busi, Zavattaro
- 2002
(Show Context)
Citation Context ...ulus with replication but without private names implies that reachability via reduction for ambient processes with public names and with replication is undecidable. Recently, in two independant works =-=[1, 19]-=-, it has been shown that the ambient calculus with replication but without private names and communication is actually Turing-complete. 3.2 Logic with Guarantee We investigate in this section the prob... |

4 | Spatial congruence for ambients is decidable - Zilio - 2000 |

2 | Modal logics for mobile ambients: Semantic reasoning. Unpublished annex to [5 - Cardelli, Gordon - 1999 |