{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300065},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572084"},{"type":"electronic","value":"9783540479680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57208-2_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:18:41Z","timestamp":1330240721000},"page":"417-431","source":"Crossref","is-referenced-by-count":14,"title":["ACSR: An algebra of communicating shared resources with dense time and priorities"],"prefix":"10.1007","author":[{"given":"Patrice","family":"Br\u00e9mond-Gr\u00e9goire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Insup","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Gerber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"issue":"6","key":"29_CR1","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","volume":"30","author":"J. Baeten","year":"1987","unstructured":"J. Baeten, J. Bergstra, and J. Klop. Ready-Trace Semantics for Concrete Process Algebra with a Priority Operator. Computer Journal, 30(6):498\u2013506, 1987.","journal-title":"Computer Journal"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"G. Barrett. The Semantics of Priority and Fairness in occam. In Proc. of 5th Int. Conf. Math. Foundations of Programming Semantics, LNCS 442. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0040258"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. A. Bergstra","year":"1985","unstructured":"J.A. Bergstra and J.W. Klop. Algebra of Communicating Processes with Abstraction. Journal of Theoretical Computer Science, 37:77\u2013121, 1985.","journal-title":"Journal of Theoretical Computer Science"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"P. Br\u00e9mond-Gr\u00e9goire, S. Davidson, and I. Lee. CCSR 92 Calculus for Communicating Shared Resources, vintage 92. In Proc. of the First North American Process Algebra Workshop, 1992.","DOI":"10.1007\/978-1-4471-3217-2_5"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"J. Camilleri and G. Winskel. CCS with Priority Choice. In Proc. of IEEE Symposium on Logic in Computer Science, 1991.","DOI":"10.1109\/LICS.1991.151649"},{"key":"29_CR6","unstructured":"Liang Chen. An Interleaving Model for Real-Time Systems. Technical Report ECS-LFCS-91-184, Department of Computer Science, University of Edinburgh, November 1991."},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0890-5401(90)90059-Q","volume":"87","author":"R. Cleaveland","year":"1990","unstructured":"R. Cleaveland and M. Hennessy. Priorities in Process Algebras. Information and Computation, 87:58\u201377, 1990.","journal-title":"Information and Computation"},{"key":"29_CR8","volume-title":"Technical Report PRG-75","author":"J. Davies","year":"1989","unstructured":"J. Davies and S. Schneider. An Introduction to Timed CSP. Technical Report PRG-75, Oxford University Computing Laboratory, UK, August 1989."},{"key":"29_CR9","unstructured":"R. Gerber and I. Lee. A Resource-Based Prioritized Bisimulation for Real-Time Systems. Technical Report MS-CIS-90-69, University of Pennsylvania, Department of Computer and Information Science, September 1990. To appear in Information and Computation."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"R. Gerber and I. Lee. CCSR: A Calculus for Communicating Shared Resources. In Proc. of CONCUR '90. LNCS 458, Springer Verlag, August 1990.","DOI":"10.1007\/BFb0039065"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"J.C. Godskesen and K. Larsen. Real-Time Calculi and Expansion Theorems. In Proc. of the First North American Process Algebra Workshop, 1992.","DOI":"10.1007\/3-540-56287-7_114"},{"key":"29_CR12","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press Series in the Foundations of Computing. MIT Press, 1988."},{"key":"29_CR13","volume-title":"Technical Report 5\/91","author":"M. Hennessy","year":"1991","unstructured":"M. Hennessy and T. Regan. A Process Algebra for Timed Systems. Technical Report 5\/91, Univ. of Sussex, UK, April 1991."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus for Communicating Systems. LNCS 92, Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"29_CR16","doi-asserted-by":"publisher","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"},{"key":"29_CR17","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"F. Moller and C. Tofts. A Temporal Calculus of Communicating Systems. In Proc. of CONCUR '90, pages 401\u2013415. LNCS 458, Springer Verlag, August 1990.","DOI":"10.1007\/BFb0039073"},{"key":"29_CR19","unstructured":"X. Nicollin and J. Sifakis. The Algebra of Timed Processes ATP: Theory and Application. Technical Report RT-C26, Institut National Polytechnique De Grenoble, November 1991."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and Automata on Infinite Sequences. In Proc. of 5th GI Conference. LNCS 104, Springer Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"G.M. Reed and A.W. Roscoe. Metric Spaces as Models for Real-Time Concurrency. In Proc. of Math. Found. of Computer Science. LNCS 298, Springer Verlag, 1987.","DOI":"10.1007\/3-540-19020-1_17"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"F. Vaandrager and N. Lynch. Action Transducers and Timed Automata. In Proc. CONCUR '92, International Conference on Concurrency Theory. LNCS 630, Springer-Verlag, August 1992.","DOI":"10.1007\/BFb0084808"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Wang Yi. CCS + Time=An Interleaving Model for Real Time Systems. In Proc. of Int. Conf. on Automata, Languages and Programming, July 1991.","DOI":"10.1007\/3-540-54233-7_136"}],"container-title":["Lecture Notes in Computer Science","CONCUR'93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57208-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:17:28Z","timestamp":1640909848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57208-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572084","9783540479680"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-57208-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}