{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:50Z","timestamp":1725664310136},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601173"},{"type":"electronic","value":"9783540494454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60117-1_23","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:44:20Z","timestamp":1330278260000},"page":"423-451","source":"Crossref","is-referenced-by-count":0,"title":["A refinement relation supporting the transition from unbounded to bounded communication buffers"],"prefix":"10.1007","author":[{"given":"Ketil","family":"St\u00f8len","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"23_CR1","volume-title":"Technical Report 29, Digital","author":"M. Abadi","year":"1988","unstructured":"M. Abadi and L. Lamport. The existence of refinement mappings. Technical Report 29, Digital, SRC, Palo Alto, 1988."},{"key":"23_CR2","volume-title":"Technical Report 66, Digital","author":"M. Abadi","year":"1990","unstructured":"M. Abadi and L. Lamport. Composing specifications. Technical Report 66, Digital, SRC, Palo Alto, 1990."},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21:181\u2013185, 1985.","journal-title":"Information Processing Letters"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-17943-7_121","volume":"258","author":"J. K. Annot","year":"1987","unstructured":"J. K. Annot and R. A. H. van Twist. A novel deadlock free and starvation free packet switching communication processor. In Proc. PA RLE'87, Lecture Notes in Computer Science 258, pages 68\u201385, 1987.","journal-title":"Proc. PA RLE'87, Lecture Notes in Computer Science"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-10699-5_102","volume":"107","author":"J. D. Brock","year":"1981","unstructured":"J. D. Brock and W. B. Ackermann. Scenarios: A model of non-determinate computation. In Proc. Formalization of Programming Concepts, Lecture Notes in Computer Science 107, pages 252\u2013259, 1981.","journal-title":"Proc. Formalization of Programming Concepts, Lecture Notes in Computer Science"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0956796800000241","volume":"2","author":"M. Broy","year":"1992","unstructured":"M. Broy and C. Dendorfer. Modelling operating system structures by timed stream processing functions. Journal of Functional Programming, 2:1\u201321, 1992.","journal-title":"Journal of Functional Programming"},{"key":"23_CR7","unstructured":"M. Broy, F. Dederichs, C. Dendorfer, M. Fuchs, T. F. Gritzner, and R. Weber. The design of distributed systems \u2014 an introduction to Focus (revised version). Technical Report SFB 342\/2\/92 A, Technische Universit\u00e4t M\u00fcnchen, 1993."},{"key":"23_CR8","volume-title":"Technical Report 89, Digital","author":"M. Broy","year":"1992","unstructured":"M. Broy. Compositional refinement of interactive systems. Technical Report 89, Digital, SRC, Palo Alto, 1992."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"M. Broy. (Inter-) Action refinement: The easy way. In Proc. Program Design Calculi, Summerschool, Marktoberdorf, pages 121\u2013158. Springer, 1993.","DOI":"10.1007\/978-3-662-02880-3_5"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-58468-4_169","volume":"863","author":"M. Broy","year":"1994","unstructured":"M. Broy and K. St\u00f8len. Specification and refinement of finite dataflow networks \u2014 a relational approach. In Proc. FTRTFT'94, Lecture Notes in Computer Science 863, pages 247\u2013267, 1994.","journal-title":"Proc. FTRTFT'94, Lecture Notes in Computer Science"},{"key":"23_CR11","unstructured":"J. He, M. Josephs, and C. A. R Hoare. A theory of synchrony and asynchrony. In Proc. IFIP WG 2.2\/2.3 Working Conference on Programming Concepts and Methods, pages 459\u2013478, 1990."},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C. A. R. Hoare","year":"1972","unstructured":"C. A. R. Hoare. Proof of correctness of data representations. Acta Informatica, 1:271\u2013282, 1972.","journal-title":"Acta Informatica"},{"key":"23_CR13","unstructured":"B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Uppsala University, 1987."},{"key":"23_CR14","unstructured":"G. Kahn. The semantics of a simple language for parallel programming. In Proc. Information Processing 74, pages 471\u2013475. North-Holland, 1974."},{"key":"23_CR15","unstructured":"R. M. Keller. Denotational models for parallel programs with indeterminate operators. In Proc. Formal Description of Programming Concepts, pages 337\u2013366. North-Holland, 1978."},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-17945-3_20","volume":"259","author":"J. N. Kok","year":"1987","unstructured":"J. N. Kok. A fully abstract semantics for data flow nets. In Proc. PARLE'87, Lecture Notes in Computer Science 259, pages 351\u2013368, 1987.","journal-title":"Proc. PARLE'87, Lecture Notes in Computer Science"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"N. Lynch and M. R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. 6th Annual ACM Symposium on Principles of Distributed Computing, pages 137\u2013151, 1987.","DOI":"10.1145\/41840.41852"},{"key":"23_CR18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6:319\u2013340, 1976.","journal-title":"Acta Informatica"},{"key":"23_CR19","unstructured":"D. Park. The \u201cfairness\u201d problem and nondeterministic computing networks. In Proc. 4th Foundations of Computer Science, Mathematical Centre Tracts 159, pages 133\u2013161. Mathematisch Centrum Amsterdam, 1983."},{"key":"23_CR20","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02311231","volume":"5","author":"P. K. Pandya","year":"1991","unstructured":"P. K. Pandya and M. Joseph. P-A logic \u2014 a compositional proof system for distributed programs. Distributed Computing, 5:37\u201354, 1991.","journal-title":"Distributed Computing"},{"key":"23_CR21","unstructured":"K. St\u00f8len, F. Dederichs, and R. Weber. Assumption\/commitment rules for networks of asynchronously communicating agents. Technical Report SFB 342\/2\/93 A, Technische Universit\u00e4t M\u00fcnchen, 1993. To appear in Formal Aspects of Computing."},{"key":"23_CR22","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1007\/3-540-54430-5_110","volume":"527","author":"K. St\u00f8len","year":"1991","unstructured":"K. St\u00f8len. A method for the development of totally correct shared-state parallel programs. In Proc. CONCUR'91, Lecture Notes in Computer Science 527, pages 510\u2013525, 1991.","journal-title":"Proc. CONCUR'91, Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60117-1_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:08Z","timestamp":1605646508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601173","9783540494454"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}