{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:46:40Z","timestamp":1725454000739},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638889"},{"type":"electronic","value":"9783540696612"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0000486","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T10:30:36Z","timestamp":1128508236000},"page":"409-423","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["The update calculus"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Parrow","sequence":"first","affiliation":[]},{"given":"Bj\u00f6rn","family":"Victor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"28_CR1","unstructured":"H. P. Barendregt. The Lambda Calculus. Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. Elsevier, 1984."},{"issue":"4","key":"28_CR2","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/48022.48023","volume":"10","author":"R. J. R. Back","year":"1988","unstructured":"R. J. R. Back and R. Kurki-Suonio. Distributed cooperation with action systems. ACM Transactions on Programming Languages and Systems, 10(4):513\u2013554, Oct. 1988.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"M. Dam. Model checking mobile processes. In E. Best, editor, CONCUR'93: Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 22\u201336. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57208-2_3"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Y. Fu. A proof theoretical approach to communication. In P. Degano and R. Gorrieri, editors, ICALP'97: Automata, Languages and Programming, volume 1256 of Lecture Notes in Computer Science, pages 325\u2013335. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63165-8_189"},{"key":"28_CR6","volume-title":"Technical Report ECS-LFCS-91-180","author":"R. Milner","year":"1991","unstructured":"R. Milner. The polyadic \u03c0-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, Oct. 1991."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1991.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow and D. Walker. A calculus of mobile processes, Parts I and II. Journal of Information and Computation, 100:1\u201377, Sept. 1992.","journal-title":"Journal of Information and Computation"},{"issue":"2","key":"28_CR9","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/inco.1995.1108","volume":"120","author":"J. Parrow","year":"1995","unstructured":"J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Journal of Information and Computation, 120(2):174\u2013197, 1995.","journal-title":"Journal of Information and Computation"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"M. Pistore and D. Sangiorgi. A partition refinement algorithm for the \u03c0-calcuius. In R. Alur and T. A. Henzinger, editors, Proceedings of CAV'96, volume 1102 of Lecture Notes in Computer Science. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61474-5_56"},{"key":"28_CR11","volume-title":"Technical Report DoCS 97\/93","author":"J. Parrow","year":"1997","unstructured":"J. Parrow and B. Victor. The update calculus (full version). Technical Report DoCS 97\/93, Department of Computer Systems, Uppsala University, Sweden, Sept. 1997."},{"key":"28_CR12","volume-title":"PhD thesis","author":"D. Sangiorgi","year":"1992","unstructured":"D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh, UK, 1992."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi. On the proof method for bisimulation (extended abstract). In J. Wiederman and P. H\u00e1jek, editors, Mathematical Foundations of Computer Science 1995 (MFCS'95), volume 969 of Lecture Notes in Computer Science, pages 479\u2013488. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60246-1_153"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi. \u03c0-calculus, internal mobility and agent-passing calculi. Rapport de Recherche RR-2539, INRIA Sophia-Antipolis, 1995.","DOI":"10.1007\/3-540-60084-1_114"},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"D. Sangiorgi. A theory of bisimulation for the \u03c0-calculus. Acta Informatica, 33:69\u201397, 1996.","journal-title":"Acta Informatica"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"G. Smolka. A foundation for higher-order concurrent constraint programming. In J.-P. Jouannaud, editor, Proc. 1st International Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 50\u201372. Springer-Verlag, Sept. 1994.","DOI":"10.1007\/BFb0016844"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"B. Victor and F. Moller. The Mobility Workbench \u2014 a tool for the \u03c0-calculus. In D. Dill, editor, CAV'94: Computer Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 428\u2013440. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58179-0_73"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"B. Victor and J. Parrow. Constraints as processes. In U. Montanari and V. Sassone, editors, CONCUR'96: Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 389\u2013405. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_66"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:05:01Z","timestamp":1578535501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000486"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638889","9783540696612"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0000486","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"7 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}