{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:38:25Z","timestamp":1725507505038},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540789123"},{"type":"electronic","value":"9783540789130"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78913-0_23","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T12:13:06Z","timestamp":1207915986000},"page":"304-319","source":"Crossref","is-referenced-by-count":1,"title":["Reactive Probabilistic Programs and Refinement Algebra"],"prefix":"10.1007","author":[{"given":"L. A.","family":"Meinicke","sequence":"first","affiliation":[]},{"given":"K.","family":"Solin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BFb0015020","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R.J.R. Back","year":"1994","unstructured":"Back, R.J.R., von Wright, J.: Trace refinement of action systems. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 367\u2013384. Springer, Heidelberg (1994)"},{"key":"23_CR2","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Algebraic notions of termination. Technical Report 2006-23, Institute of Computer Science, University of Augsburg (2006)"},{"issue":"6","key":"23_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/PL00013311","volume":"37","author":"I.J. Hayes","year":"2001","unstructured":"Hayes, I.J., Utting, M.: A sequential real-time refinement calculus. Acta Informatica\u00a037(6), 385\u2013448 (2001)","journal-title":"Acta Informatica"},{"key":"23_CR4","volume-title":"Unifying Theories of Programming","author":"C.A.R. Hoare","year":"1998","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall, Englewood Cliffs (1998)"},{"key":"23_CR5","unstructured":"H\u00f6fner, P., Struth, G.: Algebraic notions of non-termination. Technical Report CS-06-12, Department of Computer Science, University of Sheffield (2006)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11828563_20","volume-title":"Relations and Kleene Algebra in Computer Science","author":"A.K. McIver","year":"2006","unstructured":"McIver, A.K., Cohen, E., Morgan, C.C.: Using probabilistic Kleene algebra for protocol verification. In: Schmidt, R.A. (ed.) RelMiCS\/AKA 2006. LNCS, vol.\u00a04136, pp. 296\u2013310. Springer, Heidelberg (2006)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/11901433_21","volume-title":"Formal Methods and Software Engineering","author":"L.A. Meinicke","year":"2006","unstructured":"Meinicke, L.A., Hayes, I.J.: Reasoning algebraically about probabilistic loops. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol.\u00a04260, pp. 380\u2013399. Springer, Heidelberg (2006)"},{"key":"23_CR8","unstructured":"Meinicke, L.A., Solin, K.: Refinement algebra for probabilistic programs. In: Boiten, E., Derrick, J., Smith, G. (eds.) REFINE (to appear in ENTCS, 2007)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/978-3-540-27764-4_14","volume-title":"Mathematics of Program Construction","author":"B. M\u00f6ller","year":"2004","unstructured":"M\u00f6ller, B.: Lazy Kleene algebra. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 252\u2013273. Springer, Heidelberg (2004)"},{"key":"23_CR10","first-page":"351","volume-title":"APSEC 2001","author":"C.C. Morgan","year":"2001","unstructured":"Morgan, C.C., McIver, A.K.: Cost analysis of games, using program logic. In: APSEC 2001, p. 351. IEEE Computer Society Press, Washington, DC, USA (2001)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-60218-6_17","volume-title":"CONCUR \u201995 Concurrency Theory","author":"R. Segala","year":"1995","unstructured":"Segala, R.: A compositional trace-based semantics for probabilistic automata. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 234\u2013248. Springer, Heidelberg (1995)"},{"key":"23_CR12","unstructured":"Sere, K., Troubitsyna, E.A.: Probabilities in action systems. In: Proc. of the 8th Nordic Workshop on Programming Theory (1996)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11828563_25","volume-title":"Relations and Kleene Algebra in Computer Science","author":"K. Solin","year":"2006","unstructured":"Solin, K.: On two dually nondeterministic refinement algebras. In: Schmidt, R.A. (ed.) RelMiCS\/AKA 2006. LNCS, vol.\u00a04136, pp. 373\u2013387. Springer, Heidelberg (2006)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11783596_23","volume-title":"Mathematics of Program Construction","author":"K. Solin","year":"2006","unstructured":"Solin, K., von Wright, J.: Refinement algebra with operators for enabledness and termination. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol.\u00a04014, pp. 397\u2013415. Springer, Heidelberg (2006)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/11828563_27","volume-title":"Relations and Kleene Algebra in Computer Science","author":"T. Takai","year":"2006","unstructured":"Takai, T., Furusawa, H.: Monodic tree Kleene algebra. In: Schmidt, R.A. (ed.) RelMiCS\/AKA 2006. LNCS, vol.\u00a04136, pp. 402\u2013416. Springer, Heidelberg (2006)"},{"key":"23_CR16","unstructured":"Troubitsyna, E.A.: Reliability assessment through probabilistic refinement. Nordic Journal of Computing, 320\u2013342 (1999)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-45442-X_14","volume-title":"Mathematics of Program Construction","author":"J. Wright von","year":"2002","unstructured":"von Wright, J.: From Kleene algebra to refinement algebra. In: Boiten, E.A., M\u00f6ller, B. (eds.) MPC 2002. LNCS, vol.\u00a02386, pp. 233\u2013262. Springer, Heidelberg (2002)"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2003.09.002","volume":"51","author":"J. Wright von","year":"2004","unstructured":"von Wright, J.: Towards a refinement algebra. Science of Computer Programming\u00a051, 23\u201345 (2004)","journal-title":"Science of Computer Programming"}],"container-title":["Lecture Notes in Computer Science","Relations and Kleene Algebra in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78913-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:03:40Z","timestamp":1619521420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78913-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789123","9783540789130"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78913-0_23","relation":{},"subject":[]}}