The complexity of model checking mobile ambients

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

Volumn 2030, Issue , 2001, Pages 152-167

  Charatonik, Witold ^a,c   Dal Zilio, Silvano ^b   Gordon, Andrew D ^b   Mukhopadhyay, Supratik ^a   Talbot, Jean Marc ^a,d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b MICROSOFT RESEARCH   (United States)

^c Institute of Computer Science   (Poland)

^d ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); POLYNOMIAL APPROXIMATION;

AMBIENT CALCULUS; COMPLEXITY BOUNDS; MODEL CHECKING PROBLEM; POLYNOMIAL SIZE; POLYNOMIAL SPACE; POLYNOMIAL-TIME; PROCESS EXECUTION; PSPACE-COMPLETE;

MODEL CHECKING;

EID: 84945269845     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45315-6_10     Document Type: Conference Paper

References (11)

1. L. Cardelli and A.D. Gordon. Mobile ambients. Theoretical Computer Science, 240:177–213, 2000.
2. L. Cardelli and A.D. Gordon. Types for mobile ambients. In Proceedings POPL’99, pages 79–92. ACM, 1999.
3. L. Cardelli and A.D. Gordon. Equational properties of mobile ambients. In Proceedings FoSSaCS’99, volume 1578 of Lecture Notes in Computer Science, pages 212–226. Springer, 1999. An extended version appears as Technical Report MSR–TR–99–11, Microsoft Research, 1999.
4. L. Cardelli and A.D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proceedings POPL’00, pages 365–377. ACM, 2000.
5. L. Cardelli and G. Ghelli. A query language for semistructured data based on the ambient logic. To appear in one of the proceedings volumes of ETAPS’01, to accompany an invited talk. Springer, 2001.
6. L. Cardelli and A.D. Gordon. Logical properties of name restriction. In ProceedingsTLCA’01. Springer, 2001. To appear.
7. W. Charatonik, S. Dal Zilio, A.D. Gordon, S. Mukhopadhyay, and J.-M. Talbot. The complexity of model checking mobile ambients. Technical Report MSR–TR–2001–03, Microsoft Research, 2001.
8. O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312–360, 2000.
9. D. Sangiorgi. Extensionality and intensionality of the ambient logics. In Proceedings POPL’01. ACM, 2001. To appear.
10. W.J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4(2):177–192, 1970.
11. L.J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3(1):1–22, 1976.