{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:37:03Z","timestamp":1742920623869,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11780342_46","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:19:46Z","timestamp":1151475586000},"page":"445-458","source":"Crossref","is-referenced-by-count":6,"title":["An Introduction to Program and Thread Algebra"],"prefix":"10.1007","author":[{"given":"Alban","family":"Ponse","sequence":"first","affiliation":[]},{"given":"Mark B.","family":"van der Zwaag","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"46_CR1","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","volume":"54","author":"J.W. Bakker de","year":"1982","unstructured":"de Bakker, J.W., Zucker, J.I.: Processes and the denotational semantics of concurrency. Information and Control\u00a054(1-2), 70\u2013120 (1982)","journal-title":"Information and Control"},{"key":"46_CR2","unstructured":"Bergstra, J.A.: (February 2006), www.science.uva.nl\/~janb\/ta\/"},{"key":"46_CR3","unstructured":"Bergstra, J.A.: (February 2006), www.science.uva.nl\/~janb\/pga\/"},{"key":"46_CR4","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":"46_CR5","unstructured":"Bergstra, J.A., Bethke, I., Ponse, A.: Decision problems for pushdown threads. Report PRG0502, Programming Research Group, University of Amsterdam (June 2005), Available at: http:\/\/www.science.uva.nl\/research\/prog\/publications.html"},{"issue":"1-3","key":"46_CR6","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-3), 109\u2013137 (1984)","journal-title":"Information and Control"},{"issue":"2","key":"46_CR7","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"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Bergstra, J.A., Middelburg, C.A.: A Thread Algebra with Multi-Level Strategic Interleaving. Report 200441, Computing Science Department, Eindhoven University of Technology (2004)","DOI":"10.1007\/11494645_5"},{"key":"46_CR9","unstructured":"Bergstra, J.A., Middelburg, C.A.: Thread Algebra for Strategic Interleaving. Report PRG0404, Programming Research Group, University of Amsterdam (2004), www.science.uva.nl\/research\/prog\/publications.html"},{"key":"46_CR10","unstructured":"Bergstra, J.A., Middelburg, C.A.: Simulating Turing Machines on Maurer Machines. Report 200528, Computing Science Department, Eindhoven University of Technology (2005)"},{"key":"46_CR11","unstructured":"Bergstra, J.A., Middelburg, C.A.: Maurer Computers with Single-Thread Control. Report 200517, Computing Science Department, Eindhoven University of Technology (2005)"},{"key":"46_CR12","unstructured":"Bergstra, J.A., Ponse, A.: Execution architectures for program algebra. Journal of Applied Logic (to appear, 2006) An earlier version appeared as Logic Group Preprint Series 230, Department of Philosophy, Utrecht University (2004)"},{"key":"46_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1007\/11508380_112","volume-title":"Advances in Grid Computing - EGC 2005","author":"J.A. Bergstra","year":"2005","unstructured":"Bergstra, J.A., Ponse, A.: A bypass of Cohen\u2019s impossibility result. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds.) EGC 2005. LNCS, vol.\u00a03470, pp. 1097\u20131106. Springer, Heidelberg (2005)"},{"issue":"1","key":"46_CR14","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/0167-4048(87)90122-2","volume":"6","author":"F. Cohen","year":"1984","unstructured":"Cohen, F.: Computer viruses \u2014 theory and experiments. Computers & Security\u00a06(1), 22\u201335 (1984) Available as: http:\/\/vx.netlux.org\/lib\/afc01.html","journal-title":"Computers & Security"},{"key":"46_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-57785-8_173","volume-title":"STACS 94","author":"P. Jan\u010dar","year":"1994","unstructured":"Jan\u010dar, P.: Decidability questions for bisimilarity of Petri nets and some related problems. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 581\u2013592. Springer, Heidelberg (1994)"},{"key":"46_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-47849-3_28","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"P. Jan\u010dar","year":"1999","unstructured":"Jan\u010dar, P., Moller, F., Sawa, Z.: Simulation problems for one-counter machines. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol.\u00a01725, pp. 404\u2013407. Springer, Heidelberg (1999)"},{"issue":"4","key":"46_CR17","first-page":"80","volume":"23","author":"C. Jesshope","year":"2001","unstructured":"Jesshope, C.: Implementing an efficient vector instruction set in a chip multi-processor using micro-threaded pipelines. Australian Computer Science Communications\u00a023(4), 80\u201388 (2001)","journal-title":"Australian Computer Science Communications"},{"issue":"2","key":"46_CR18","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/321328.321334","volume":"13","author":"W.D. Maurer","year":"1966","unstructured":"Maurer, W.D.: A theory of computer instructions. Journal of the ACM\u00a013(2), 226\u2013235 (1966)","journal-title":"Journal of the ACM"},{"key":"46_CR19","unstructured":"Vu, T.D.: Metric denotational semantics for BPPA. Report PRG0503, Programming Research Group, University of Amsterdam (July 2005), Available at: http:\/\/www.science.uva.nl\/research\/prog\/publications.html"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T21:17:47Z","timestamp":1683494267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11780342_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}