{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:27:21Z","timestamp":1739338041897,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034657"},{"type":"electronic","value":"9783642034664"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03466-4_8","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T07:20:54Z","timestamp":1249284054000},"page":"127-139","source":"Crossref","is-referenced-by-count":0,"title":["Transmission Protocols for Instruction Streams"],"prefix":"10.1007","author":[{"given":"J. A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"C. A.","family":"Middelburg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S1567-8326(02)00018-8","volume":"51","author":"J.A. Bergstra","year":"2002","unstructured":"Bergstra, J.A., Loots, M.E.: Program algebra for sequential code. Journal of Logic and Algebraic Programming\u00a051(2), 125\u2013156 (2002)","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00236-007-0040-5","volume":"44","author":"J.A. Bergstra","year":"2007","unstructured":"Bergstra, J.A., Bethke, I., Ponse, A.: Decision problems for pushdown threads. Acta Informatica\u00a044(2), 75\u201390 (2007)","journal-title":"Acta Informatica"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.jal.2008.07.001","volume":"6","author":"J.A. Bergstra","year":"2008","unstructured":"Bergstra, J.A., Middelburg, C.A.: Program algebra with a jump-shift instruction. Journal of Applied Logic\u00a06(4), 553\u2013563 (2008)","journal-title":"Journal of Applied Logic"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11780342_46","volume-title":"Logical Approaches to Computational Barriers","author":"A. Ponse","year":"2006","unstructured":"Ponse, A., van der Zwaag, M.B.: An introduction to program and thread algebra. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 445\u2013458. Springer, Heidelberg (2006)"},{"issue":"1\u20133","key":"8_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control\u00a060(1\u20133), 109\u2013137 (1984)","journal-title":"Information and Control"},{"key":"8_CR6","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624193","volume-title":"Process Algebra","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol.\u00a018. Cambridge University Press, Cambridge (1990)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for non-determinism and concurrency. Journal of the ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"8_CR8","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"Journal of the ACM"},{"key":"8_CR10","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"issue":"2\u20133","key":"8_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.3233\/FUN-2006-712-302","volume":"71","author":"J.A. Bergstra","year":"2006","unstructured":"Bergstra, J.A., Middelburg, C.A.: Thread algebra with multi-level strategies. Fundamenta Informaticae\u00a071(2\u20133), 153\u2013182 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45061-0_1","volume-title":"Automata, Languages and Programming","author":"J.A. Bergstra","year":"2003","unstructured":"Bergstra, J.A., Bethke, I.: Polarized process algebra and program equivalence. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1\u201321. Springer, Heidelberg (2003)"},{"key":"8_CR13","series-title":"Texts in Theoretical Computer Science, An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04293-9","volume-title":"Introduction to Process Algebra","author":"W.J. Fokkink","year":"2000","unstructured":"Fokkink, W.J.: Introduction to Process Algebra. Texts in Theoretical Computer Science, An EATCS Series. Springer, Berlin (2000)"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/BF01215407","volume":"6","author":"J.C.M. Baeten","year":"1994","unstructured":"Baeten, J.C.M., Bergstra, J.A.: On sequential composition, action prefixes and process prefix. Formal Aspects of Computing\u00a06(3), 250\u2013268 (1994)","journal-title":"Formal Aspects of Computing"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/BF01214556","volume":"8","author":"J.C.M. Baeten","year":"1996","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Discrete time process algebra. Formal Aspects of Computing\u00a08(2), 188\u2013208 (1996)","journal-title":"Formal Aspects of Computing"},{"key":"8_CR16","series-title":"Monographs in Theoretical Computer Science, An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04995-2","volume-title":"Process Algebra with Timing","author":"J.C.M. Baeten","year":"2002","unstructured":"Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. Monographs in Theoretical Computer Science, An EATCS Series. Springer, Berlin (2002)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03466-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T16:12:15Z","timestamp":1739290335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03466-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034657","9783642034664"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03466-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}