{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:26:51Z","timestamp":1748071611017},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418641"},{"type":"electronic","value":"9783540453154"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_10","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:28:39Z","timestamp":1196663319000},"page":"152-167","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The Complexity of Model Checking Mobile Ambients"],"prefix":"10.1007","author":[{"given":"Witold","family":"Charatonik","sequence":"first","affiliation":[]},{"given":"Silvano","family":"Dal Zilio","sequence":"additional","affiliation":[]},{"given":"Andrew D.","family":"Gordon","sequence":"additional","affiliation":[]},{"given":"Supratik","family":"Mukhopadhyay","sequence":"additional","affiliation":[]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"L. Cardelli and A.D. Gordon. Mobile ambients. Theoretical Computer Science, 240:177\u2013213, 2000.","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A.D. Gordon. Types for mobile ambients. In Proceedings POPL\u201999, pages 79\u201392. ACM, 1999.","DOI":"10.1145\/292540.292550"},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","first-page":"212","volume-title":"Proceedings FoSSaCS\u201999","author":"L. Cardelli","year":"1999","unstructured":"L. Cardelli and A.D. Gordon. Equational properties of mobile ambients. In Proceedings FoSSaCS\u201999, volume 1578 of Lecture Notes in Computer Science, pages 212\u2013226. Springer, 1999. An extended version appears as Technical Report MSR-TR-99-11, Microsoft Research, 1999."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A.D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proceedings POPL\u201900, pages 365\u2013377. ACM, 2000.","DOI":"10.1145\/325694.325742"},{"key":"10_CR5","unstructured":"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\u201901, to accompany an invited talk. Springer, 2001."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A.D. Gordon. Logical properties of name restriction. In ProceedingsTLCA\u201901. Springer, 2001. To appear.","DOI":"10.1007\/3-540-45413-6_8"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-45315-6_10"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312\u2013360, 2000.","journal-title":"Journal of the ACM"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi. Extensionality and intensionality of the ambient logics. In Proceedings POPL\u201901. ACM, 2001. To appear.","DOI":"10.1145\/360204.375707"},{"issue":"2","key":"10_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"W.J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4(2):177\u2013192, 1970.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"L.J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3(1):1\u201322, 1976.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:22:40Z","timestamp":1558279360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"23 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}