{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:42:41Z","timestamp":1649162561561},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2014,11,21]],"date-time":"2014-11-21T00:00:00Z","timestamp":1416528000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2016,9]]},"abstract":"<jats:p>We consider models of CSP based on recording <jats:italic>availability<\/jats:italic> information, i.e. the models record what events could have been performed instead of those that were actually performed. We present many different varieties of such models. For each, we give a compositional semantics, congruent to the operational semantics, and prove full abstraction and no-junk results. We compare the expressiveness of the different models.<\/jats:p>","DOI":"10.1017\/s0960129514000334","type":"journal-article","created":{"date-parts":[[2014,11,21]],"date-time":"2014-11-21T13:21:20Z","timestamp":1416576080000},"page":"1022-1053","source":"Crossref","is-referenced-by-count":0,"title":["Models for CSP with availability information"],"prefix":"10.1017","volume":"26","author":[{"given":"GAVIN","family":"LOWE","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,11,21]]},"reference":[{"key":"S0960129514000334_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3"},{"key":"S0960129514000334_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11423348_2"},{"key":"S0960129514000334_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"key":"S0960129514000334_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57208-2_6"},{"key":"S0960129514000334_ref11","doi-asserted-by":"crossref","unstructured":"Phillips I. (1987) Refusal testing. Theoretical Computer Science.","DOI":"10.1016\/0304-3975(87)90117-4"},{"key":"S0960129514000334_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"S0960129514000334_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2008.10.002"},{"key":"S0960129514000334_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-258-0"},{"key":"S0960129514000334_ref20","unstructured":"Welch P. , Brown N. , Morres J. , Chalmers K. and Sputh B. (2007) Integrating and extending JCSP. In: Communicating Process Architectures 48\u201376."},{"key":"S0960129514000334_ref13","volume-title":"The Theory and Practice of Concurrency","author":"Roscoe","year":"1997"},{"key":"S0960129514000334_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036937"},{"key":"S0960129514000334_ref9","unstructured":"Mukarram A. (1993) A Refusal Testing Model for CSP, D. Phil thesis, Oxford."},{"key":"S0960129514000334_ref4","unstructured":"Formal Systems (Europe) Ltd. (2005) Failures Divergence Refinement \u2013 User Manual and Tutorial, Version 2.8.2."},{"key":"S0960129514000334_ref12","first-page":"353","volume-title":"A Classical Mind, Essays in Honour of C. A. R. Hoare","author":"Roscoe","year":"1994"},{"key":"S0960129514000334_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.04.025"},{"key":"S0960129514000334_ref7","first-page":"325","volume-title":"Proceedings of Concurrent Process Architectures","author":"Lowe","year":"2009"},{"key":"S0960129514000334_ref6","volume-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"S0960129514000334_ref5","unstructured":"Gibson-Robinson T. (2010) Tyger: A Tool for Automatically Simulating CSP-Like Languages in CSP, Master's thesis, Oxford University http:\/\/www.cs.ox.ac.uk\/files\/4607\/Thesis.pdf."},{"key":"S0960129514000334_ref15","unstructured":"Roscoe A. W. (2009) On the expressiveness of CSP. Available via http:\/\/web.comlab.ox.ac.uk\/\/files\/1383\/complete(3).pdf."},{"key":"S0960129514000334_ref1","volume-title":"Foundations of Multithreaded, Parallel, and Distributed Programming","author":"Andrews","year":"2000"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T00:06:36Z","timestamp":1555632396000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000334\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,21]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S0960129514000334"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000334","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,21]]}}}