{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T20:31:31Z","timestamp":1673469091453},"reference-count":40,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2091,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1016\/j.tcs.2007.09.001","type":"journal-article","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T07:08:46Z","timestamp":1189494526000},"page":"267-289","source":"Crossref","is-referenced-by-count":16,"title":["Tutorial on separation results in process calculi via leader election problems"],"prefix":"10.1016","volume":"388","author":[{"given":"Maria Grazia","family":"Vigliotti","sequence":"first","affiliation":[]},{"given":"Iain","family":"Phillips","sequence":"additional","affiliation":[]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2007.09.001_b1","series-title":"Proceedings of the 12th Annual ACM Symposium on Theory of Computing","first-page":"82","article-title":"Local and global properties in networks of processors","author":"Angluin","year":"1980"},{"key":"10.1016\/j.tcs.2007.09.001_b2","unstructured":"G. Boudol, Asynchrony and the \u03c0-calculus, Technical Report 1702, INRIA Sophia-Antipolis, 1992"},{"key":"10.1016\/j.tcs.2007.09.001_b3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00263584","article-title":"On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes","volume":"25","author":"Boug\u00e9","year":"1988","journal-title":"Acta Informatica"},{"key":"10.1016\/j.tcs.2007.09.001_b4","series-title":"Proceedings of 4th International Symposium on Theoretical Aspects of Computer Software","first-page":"38","article-title":"Boxed ambients","volume":"vol. 2215","author":"Bugliesi","year":"2001"},{"issue":"1","key":"10.1016\/j.tcs.2007.09.001_b5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/963778.963781","article-title":"Access control for mobile agents: The calculus of Boxed Ambients","volume":"26","author":"Bugliesi","year":"2004","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/j.tcs.2007.09.001_b6","unstructured":"D. Cacciagrano, F. Corradini, C. Palamidessi, Separation of synchronous and asynchronous communication via testing, Theoretical Computer Science 386 (3), in press (doi:10.1016\/j.tcs.2007.07.009)"},{"issue":"2","key":"10.1016\/j.tcs.2007.09.001_b7","first-page":"70","article-title":"On the expressive power of polyadic synchronisation in \u03c0-calculus","volume":"10","author":"Carbone","year":"2003","journal-title":"Nordic Journal of Computing"},{"key":"10.1016\/j.tcs.2007.09.001_b8","doi-asserted-by":"crossref","unstructured":"L. Cardelli, A.D. Gordon, Anytime, anywhere: Modal logic for Mobile Ambients, in: Proceedings of the 27th ACM Symposium on Principles of Programming Languages, 2000, pp. 365\u2013377","DOI":"10.1145\/325694.325742"},{"issue":"1","key":"10.1016\/j.tcs.2007.09.001_b9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","article-title":"Mobile ambients","volume":"240","author":"Cardelli","year":"2000","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/j.tcs.2007.09.001_b10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2004.11.005","article-title":"The Seal calculus","volume":"201","author":"Castagna","year":"2005","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2007.09.001_b11","series-title":"Proceedings of 12th International Symposium on Fundamentals of Computation Theory","first-page":"258","article-title":"Expressiveness of point-to-point versus broadcast communications","volume":"vol. 1684","author":"Ene","year":"1999"},{"key":"10.1016\/j.tcs.2007.09.001_b12","series-title":"Proceedings of 9th International Conference on Foundations of Software Science and Computation Structures","first-page":"47","article-title":"On the relative expressive power of asynchronous communication primitives","volume":"vol. 3921","author":"Gorla","year":"2006"},{"key":"10.1016\/j.tcs.2007.09.001_b13","unstructured":"D. Gorla, Comparing calculi for mobility via their relative expressive power, Tech. Rep. 09\/2006, Dip Informatica, Univ. di Roma La Sapienza"},{"issue":"8","key":"10.1016\/j.tcs.2007.09.001_b14","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Communications of the ACM"},{"key":"10.1016\/j.tcs.2007.09.001_b15","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/j.tcs.2007.09.001_b16","series-title":"Proceedings of European Conference on Object-Oriented Programming","first-page":"133","article-title":"An object calculus for asynchronous communication","volume":"vol. 512","author":"Honda","year":"1991"},{"issue":"1","key":"10.1016\/j.tcs.2007.09.001_b17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/596980.596981","article-title":"Mobile safe ambients","volume":"25","author":"Levi","year":"2003","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/j.tcs.2007.09.001_b18","series-title":"Distributed Algorithms","author":"Lynch","year":"1996"},{"key":"10.1016\/j.tcs.2007.09.001_b19","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"2","key":"10.1016\/j.tcs.2007.09.001_b20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"2","author":"Milner","year":"1992","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/j.tcs.2007.09.001_b21","series-title":"Communicating and Mobile Systems: The \u03c0-Calculus","author":"Milner","year":"1999"},{"issue":"1","key":"10.1016\/j.tcs.2007.09.001_b22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus for mobile processes, parts I and II","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2007.09.001_b23","series-title":"Proceedings of the 19th International Colloquium on Automata, Languages and Programming","first-page":"685","article-title":"Barbed bisimulation","volume":"vol. 623","author":"Milner","year":"1992"},{"key":"10.1016\/j.tcs.2007.09.001_b24","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/inco.1999.2822","article-title":"What is a \u2018good\u2019 encoding of guarded choice?","volume":"156","author":"Nestmann","year":"2000","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2007.09.001_b25","series-title":"Proceedings of 14th International Conference on Concurrency Theory","first-page":"393","article-title":"Modeling consensus in a process calculus","volume":"vol. 2761","author":"Nestmann","year":"2003"},{"issue":"1","key":"10.1016\/j.tcs.2007.09.001_b26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2000.2868","article-title":"Decoding choice encodings","volume":"163","author":"Nestmann","year":"2000","journal-title":"Information and Computation"},{"issue":"5","key":"10.1016\/j.tcs.2007.09.001_b27","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1017\/S0960129503004043","article-title":"Comparing the expressive power of the synchronous and the asynchronous \u03c0-calculi","volume":"13","author":"Palamidessi","year":"2003","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/j.tcs.2007.09.001_b28","doi-asserted-by":"crossref","unstructured":"I.C.C. Phillips, CCS with priority guards, Journal of Logic and Algebraic Programming, in press (doi:10.1016\/j.jlap.2007.06.005)","DOI":"10.1016\/j.jlap.2007.06.005"},{"key":"10.1016\/j.tcs.2007.09.001_b29","doi-asserted-by":"crossref","unstructured":"I.C.C. Phillips, M.G. Vigliotti, Symmetric electoral systems for ambient calculi, Information & Computation, in press (doi:10.1016\/j.ic.2007.08.005)","DOI":"10.1016\/j.ic.2007.08.005"},{"key":"10.1016\/j.tcs.2007.09.001_b30","series-title":"Proceedings of IFIP International Conference on Theoretical Computer Science","first-page":"550","article-title":"On reduction semantics for the Push and Pull Ambient Calculus","author":"Phillips","year":"2002"},{"issue":"3","key":"10.1016\/j.tcs.2007.09.001_b31","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.tcs.2006.02.004","article-title":"Leader election in rings of ambient processes","volume":"356","author":"Phillips","year":"2006","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2007.09.001_b32","series-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","first-page":"455","article-title":"Pict: A programming language based on the pi-calculus","author":"Pierce","year":"2000"},{"key":"10.1016\/j.tcs.2007.09.001_b33","series-title":"Proceedings of 8th International Workshop on Expressiveness on Concurrency","first-page":"83","article-title":"Broadcast calculus interpreted in CCS up to bisimulation","volume":"vol. 52","author":"Prasad","year":"2002"},{"key":"10.1016\/j.tcs.2007.09.001_b34","unstructured":"D. Sangiorgi, Expressing mobility in process algebra: First-order and higher-order paradigms, Ph.D. Thesis, University of Edinburgh, 1993"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2007.09.001_b35","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(96)00075-8","article-title":"\u03c0-calculus, internal mobility and agent-passing calculi","volume":"167","author":"Sangiorgi","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2007.09.001_b36","series-title":"The \u03c0-Calculus: A Theory of Mobile Processes","author":"Sangiorgi","year":"2001"},{"key":"10.1016\/j.tcs.2007.09.001_b37","series-title":"Distributed Algorithms","author":"Tel","year":"2000"},{"key":"10.1016\/j.tcs.2007.09.001_b38","unstructured":"M.G. Vigliotti, Reduction semantics for ambient calculi, Ph.D. Thesis, Imperial College London, 2004"},{"key":"10.1016\/j.tcs.2007.09.001_b39","series-title":"Proceedings of 16th Conference on Foundations of Software Technology and Theoretical Computer Science","first-page":"371","article-title":"Graph types for monadic mobile processes","volume":"vol. 1180","author":"Yoshida","year":"1996"},{"issue":"5","key":"10.1016\/j.tcs.2007.09.001_b40","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1017\/S0960129503004079","article-title":"On the expressiveness of pure safe ambients","volume":"13","author":"Zimmer","year":"2003","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507006597?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507006597?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T00:53:45Z","timestamp":1546563225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397507006597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":40,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["S0304397507006597"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2007.09.001","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}