{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:33:03Z","timestamp":1725492783472},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441441"},{"type":"electronic","value":"9783540457190"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45719-4_16","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T10:55:00Z","timestamp":1191927300000},"page":"223-239","source":"Crossref","is-referenced-by-count":3,"title":["A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching"],"prefix":"10.1007","author":[{"given":"Prasannaa","family":"Thati","sequence":"first","affiliation":[]},{"given":"Reza","family":"Ziaei","sequence":"additional","affiliation":[]},{"given":"Gul","family":"Agha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"G. Agha. Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, 1986.","DOI":"10.7551\/mitpress\/1086.001.0001"},{"key":"16_CR2","series-title":"Lect Notes Comput Sci","volume-title":"On Bisimulations for Asynchronous \u03c0-Calculus","author":"R. Amadio","year":"1996","unstructured":"R. Amadio, I. Castellani, and D. Sangiorgi. On Bisimulations for Asynchronous \u03c0-Calculus. In Proceedings of CONCUR\u2019 96. Springer-Verlag, 1996. LNCS 1119."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"M. Boreale, R. De Nicola, and R. Pugliese. Trace and testing equivalence on asynchronous processes, 2002.","DOI":"10.1006\/inco.2001.3080"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Michele Boreale and D. Sangiorgi. Bisimulation in Name Passing Calculi without Matching. Proceedings of LICS, 1998.","DOI":"10.1109\/LICS.1998.705653"},{"key":"16_CR5","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Matthew Hennessy and Julian Rathke. Typed behavioral equivalences for processes in the presence of subtyping. Technical report, Uni versity of Sussex, Computer Science, March 2001.","DOI":"10.1016\/S1571-0661(04)00309-3"},{"key":"16_CR7","series-title":"Lect Notes Comput Sci","volume-title":"An Object Calculus for Asynchronous Communication","author":"K. Honda","year":"1991","unstructured":"K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In Fifth European Conference on Object-Oriented Programming, July 1991. LNCS 512, 1991."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"M. Merro. On equators in asynchronous name-passing calculi without matching. Electronic Notes in Theoretical Computer Science, 27, 1999.","DOI":"10.1016\/S1571-0661(05)80295-6"},{"key":"16_CR9","series-title":"Lect Notes Comput Sci","volume-title":"On Asynchrony in Name-Passing Calculi","author":"M. Merro","year":"1998","unstructured":"M. Merro and D. Sangiorgi. On Asynchrony in Name-Passing Calculi. In Proceeding of ICALP\u2019 98. Springer-Verlag, 1998. LNCS 1443."},{"key":"16_CR10","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\u201377, 1992.","journal-title":"Information and Computation"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"R. De Nicola and M. Hennesy. Testing equivalence for processes. In Theoretical Computer Science, volume 34, pages 83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"16_CR12","unstructured":"B. C. Pierce and D. N. Turner. Pict: A programming Language Based on the \u03c0-Calculus. Technical Report CSCI-476, Indiana University, March 1997."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Prasanna Thati, Reza Ziaei, and Gul Agha. A theory of may testing for asynchronous calculi with locality and no name matching. Technical Report UIUCDCS-R-2002-2277, University of Illinois at Urbana Champaign, May 2002.","DOI":"10.1007\/3-540-45719-4_16"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45719-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T09:06:13Z","timestamp":1629882373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45719-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441441","9783540457190"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45719-4_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}