{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299736},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631415"},{"type":"electronic","value":"9783540691884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63141-0_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:09:08Z","timestamp":1330297748000},"page":"376-390","source":"Crossref","is-referenced-by-count":20,"title":["First-order axioms for asynchrony"],"prefix":"10.1007","author":[{"given":"Peter","family":"Selinger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"26_CR1","unstructured":"S. Abramsky. Interaction categories and communicating sequential processes. In A. W. Roscoe, editor, A Classical Mind: Essays in honour of C. A. R. Hoare, pages 1\u201316. Prentice Hall International, 1994."},{"key":"26_CR2","unstructured":"S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and typed concurrent programming. In Proceedings of the 1994 Marktoberdorf Summer School. Springer, 1994."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous \u03c0-calculus. In CONCUR '96, Springer LNCS 1119, pages 147\u2013162, 1996.","DOI":"10.1007\/3-540-61604-7_53"},{"key":"26_CR4","unstructured":"M. A. Bednarczyk. Categories of asynchronous systems. PhD thesis, University of Sussex, 1988."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217\u2013248, 1992.","journal-title":"Theoretical Computer Science"},{"key":"26_CR6","unstructured":"G. Boudol. Asynchrony and the \u03c0-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1992."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"C. Fournet and G. Gonthier. The reflexive cham and the join-calculus. In POPL '96, 1996.","DOI":"10.1145\/237721.237805"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"C. Fournet, G. Gonthier, J.-J. Levy, L. Maranget, and D. Remy. A calculus of mobile agents. In CONCUR '96, Springer LNCS 1119, pages 406\u2013421, 1996.","DOI":"10.1007\/3-540-61604-7_67"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proc. ECOOP 91, Geneve, 1991.","DOI":"10.1007\/BFb0057019"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0890-5401(89)90066-7","volume":"82","author":"N. A. Lynch","year":"1989","unstructured":"N. A. Lynch and E. W. Stark. A proof of the Kahn principle for input\/output automata. Information and Computation, 82:81\u201392, 1989.","journal-title":"Information and Computation"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicationg Systems. Springer LNCS 92. 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"26_CR12","unstructured":"R. Milner. Operational and algebraic semantics of concurrent processes. Technical report, University of Edinburgh, Nov. 1987. Chapter for the Handbook of Theoretical Computer Science."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"C. Palamidessi. Comparing the expressive power of the synchronous and the asynchronous \u03c0-calculus. In POPL '97 (Paris), 1997.","DOI":"10.1145\/263699.263731"},{"key":"26_CR14","first-page":"449","volume":"28","author":"M.W. Shields","year":"1985","unstructured":"M.W. Shields. Concurrent machines. Theoretical Computer Science, 28:449\u2013465, 1985.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","CONCUR '97: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63141-0_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:11Z","timestamp":1605647771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63141-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631415","9783540691884"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-63141-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}