{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T15:40:03Z","timestamp":1736264403552,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540530487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039065","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T14:58:08Z","timestamp":1138719488000},"page":"263-277","source":"Crossref","is-referenced-by-count":16,"title":["CCSR: A calculus for communicating shared resources"],"prefix":"10.1007","author":[{"given":"Richard","family":"Gerber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Insup","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"R. Cleaveland and M. Hennessy. Priorities in Process Algebras. In Proc. of IEEE Symposium on Logic in Computer Science, 1988.","key":"20_CR1","DOI":"10.1109\/LICS.1988.5118"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(84)90022-7","volume":"32","author":"N. Francez","year":"1984","unstructured":"N. Francez, D. Lehmann, and A. Pnueli. A Linear History Semantics for Distributed Programming. Theoretical Computer Science, 32:25\u201346, 1984.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"R. Gerber and I. Lee. Communicating Shared Resources: A Model for Distributed Real-Time Systems. In Proc. 10th IEEE Real-Time Systems Symposium, 1989.","key":"20_CR3","DOI":"10.1109\/REAL.1989.63558"},{"unstructured":"R. Gerber and I. Lee. The Formal Treatment of Priorities in Real-Time Computation. In Proc. 6th IEEE Workshop on Real-Time Software and Operating Systems, 1989.","key":"20_CR4"},{"issue":"8","key":"20_CR5","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"C.A.R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666\u2013676, August 1978.","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","key":"20_CR6","DOI":"10.1007\/978-3-642-82921-5_4"},{"doi-asserted-by":"crossref","unstructured":"C. Huizing, R. Gerth, and W.P. de Roever. Full Abstraction of a Denotational Semantics for Real-time Concurrency. In Proc. 14th ACM Symposium on Principles of Programming Languages, pages 223\u2013237, 1987.","key":"20_CR7","DOI":"10.1145\/41625.41645"},{"unstructured":"R. Janicki and P. Lauer. On the Semantics of Priority Systems. In Proc. of Int. Conf. on Parallel Processing, 1988.","key":"20_CR8"},{"doi-asserted-by":"crossref","unstructured":"R. Koymans, R.K. Shyamasundar, W.P. de Roever, R. Gerth, and S. Arun-Kumar. Compositional Semantics for Real-Time Distributed Computing. In Logic of Programs Workshop '85, LNCS 193, 1985.","key":"20_CR9","DOI":"10.1007\/3-540-15648-8_14"},{"unstructured":"I. Lee and V. Gehlot. Language Constructs for Distributed Real-Time Programming. In IEEE Real-Time Systems Symposium, 1985.","key":"20_CR10"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus for Communicating Systems. LNCS 92, Springer-Verlag, 1980.","key":"20_CR12","DOI":"10.1007\/3-540-10235-3"},{"unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989.","key":"20_CR13"},{"unstructured":"Gordon Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Dept., Aarhus University, 1981.","key":"20_CR14"},{"doi-asserted-by":"crossref","unstructured":"A. Salwicki and T. M\u00fcldner. On the Algorithmic Properties of Concurrent Programs. In Proceedings of Logic of Programs, LNCS 125, 1981.","key":"20_CR15","DOI":"10.1007\/3-540-11160-3_6"}],"container-title":["Lecture Notes in Computer Science","CONCUR '90 Theories of Concurrency: Unification and Extension"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039065.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T15:27:39Z","timestamp":1736263659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540530487"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0039065","relation":{},"subject":[]}}