The decidability of model checking mobile ambients

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2142, Issue , 2001, Pages 339-354

  Charatonik, Witold ^a,b   Talbot, Jean Marc ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

^c ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTABILITY AND DECIDABILITY; DIFFERENTIATION (CALCULUS); MODEL CHECKING;

AMBIENT CALCULUS; AMBIENT LOGIC; DISTRIBUTED AND MOBILE COMPUTATIONS; MOBILE AMBIENTS; MODEL CHECKING ALGORITHM; NAME RESTRICTION; SOFTWARE AND HARDWARES; UNDECIDABILITY;

COMPUTER CIRCUITS;

EID: 84944210484     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44802-0_24     Document Type: Conference Paper

References (12)

1. L. Cardelli and G. Ghelli. A query language based on the ambient logic. In Proceedings of the 9th European Symposium on Programming ESOP’01, volume 2028 of LNCS, pages 1–22. Springer, 2001.
2. L. Cardelli and A. D. Gordon. Equational properties of mobile ambients. In Proceedings FoSSaCS’99, volume 1578 of LNCS, pages 212–226. Springer, 1999. An extended version appears as Microsoft Research Technical Report MSR–TR– 99–11, April 1999.
3. L. Cardelli and A. D. Gordon. Modal logics for mobile ambients: Semantic reasoning. Unpublished annex to [5], 1999.
4. L. Cardelli and A. D. Gordon. Types for mobile ambients. In Proceedings POPL’99, pages 79–92. ACM, Jan. 1999.
5. L. Cardelli and A. D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proceedings POPL’00, pages 365–377. ACM, Jan. 2000.
6. L. Cardelli and A. D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177–213, 2000.
7. L. Cardelli and A. D. Gordon. Logical properties of name restriction. In Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (TLCA’01), volume 2044 of LNCS, pages 46–60. Springer, 2001.
8. W. Charatonik, S. Dal Zilio, A. D. Gordon, S. Mukhopadhyay, and J.-M. Talbot. The complexity of model checking mobile ambients. In Proceedings FoSSaCS’01, volume 2030 of LNCS, pages 152–167. Springer, 2001.
9. S. Dal Zilio. Spatial congruence for ambients is decidable. In Proceedings of the 6th Asian Computing Science Conference (ASIAN’00), volume 1961 of LNCS, pages 88–103. Springer, 2000. A full version Technical Report MSR-TR-2000-57, Microsoft Research.
10. E. L. Post. Recursively Enumerable Sets of Positive Integers and their Decision Problems. Bulletion of the American Mathematical Society, 50:284–316, 1944.
11. D. Sangiorgi. Extensionality and intensionality of the ambient logics. In Proceedings POPL’01, pages 4–13. ACM, Jan. 2001.
12. B. A. Trakhtenbrot. The impossibility of an algorithm for the decision problem for finite models. Doklady Akademii Nauk SSR, 70:569–572, 1950.