{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:16:35Z","timestamp":1725495395213},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657033"},{"type":"electronic","value":"9783540490593"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49059-0_18","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:56:57Z","timestamp":1194991017000},"page":"255-269","source":"Crossref","is-referenced-by-count":11,"title":["Finite State Verification for the Asynchronous \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Montanari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Pistore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,3,12]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"192","author":"R. Amadio","year":"1998","unstructured":"R. Amadio, I. Castellani and D. Sangiorgi. On bisimulations for the asynchronous \u03c0-calculus. Theoretical Computer Science, 192(2):291\u2013324, 1998.","journal-title":"Theoretical Computer Science"},{"key":"18_CR2","unstructured":"G. Boudol. Asynchrony and the \u03c0-calculus. Research Report 1702, INRIA, Sophia-Antipolis, 1991."},{"key":"18_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proc. TACAS\u201997","author":"G. Ferrari","year":"1997","unstructured":"G. Ferrari, G. Ferro, S. Gnesi, U. Montanari, M. Pistore and G. Ristori. An automata-based verification environment for mobile processes. In Proc. TACAS\u201997, LNCS 1217. Springer Verlag, 1997."},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CONCUR\u201996","author":"C. Fournet","year":"1996","unstructured":"C. Fournet, G. Gonthier, J.-J. L\u00e9vy, L. Maranget and D. R\u00e9my. A calculus of mobile agents. In Proc. CONCUR\u201996, LNCS 1119. Springer Verlag, 1996."},{"key":"18_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proc. ECOOP\u201991","author":"K. Honda","year":"1991","unstructured":"K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proc. ECOOP\u201991, LNCS 612. Springer Verlag, 1991."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"R. Milner. The polyadic \u03c0-calculus: a tutorial. In Logic and Algebra of Specification, NATO ASI Series F, Vol. 94. Springer Verlag, 1993.","DOI":"10.1007\/978-3-642-58041-3_6"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","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). Information and Computation, 100(1):1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"U. Montanari and M. Pistore. An introduction to history dependent automata. In Proc. HOOTS II, ENTCS 10. Elsevier, 1998.","DOI":"10.1016\/S1571-0661(05)80696-6"},{"issue":"6","key":"18_CR9","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"18_CR10","unstructured":"M. Pistore. History Dependent Automata. PhD Thesis. Dipartimento di Informatica, Universit\u00e0 di Pisa, 1999."},{"key":"18_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CAV\u201996","author":"M. Pistore","year":"1996","unstructured":"M. Pistore and D. Sangiorgi. A partition refinement algorithm for the \u03c0-calculus. In Proc. CAV\u201996, LNCS 1102. Spinger Verlag, 1996."},{"key":"18_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proc. FoSSaCS\u201998","author":"J. Rathke","year":"1998","unstructured":"J. Rathke. Resource based models for asynchrony. In Proc. FoSSaCS\u201998, LNCS 1378. Springer Verlag, 1998."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"D. Sangiorgi. A theory of bisimulation for \u03c0-calculus. Acta Informatica, 33:69\u201397, 1996.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49059-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:00:36Z","timestamp":1556967636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49059-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657033","9783540490593"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-49059-0_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}