{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:05:26Z","timestamp":1725584726966},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642210693"},{"type":"electronic","value":"9783642210709"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21070-9_20","type":"book-chapter","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T04:02:27Z","timestamp":1307419347000},"page":"264-279","source":"Crossref","is-referenced-by-count":4,"title":["On Probabilistic Kleene Algebras, Automata and Simulations"],"prefix":"10.1007","author":[{"given":"Annabelle","family":"McIver","sequence":"first","affiliation":[]},{"given":"Tahiry M.","family":"Rabehaja","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Handbook of Process Algebra","year":"2001","key":"20_CR1","unstructured":"Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier, Amsterdam (2001)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-14052-5_13","volume-title":"Interactive Theorem Proving","author":"T. Braibant","year":"2010","unstructured":"Braibant, T., Pous, D.: An efficient coq tactic for deciding kleene algebras. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol.\u00a06172, pp. 163\u2013178. Springer, Heidelberg (2010)"},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM\u00a011(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/635499.635502","volume":"4","author":"D. Bustan","year":"2003","unstructured":"Bustan, D., Grumberg, O.: Simulation-based minimization. ACM Trans. Comput. Logic\u00a04(2), 181\u2013206 (2003)","journal-title":"ACM Trans. Comput. Logic"},{"key":"20_CR5","unstructured":"Cohen, E.: Weak Kleene algebra is sound and (possibly) complete for simulation. CoRR abs\/0910.1028 (2009)"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","volume":"37","author":"W. Fokkink","year":"1994","unstructured":"Fokkink, W., Zantema, H.: Basic process algebra with iteration: Completeness of its equational axioms. Comput. J.\u00a037(4), 259\u2013268 (1994)","journal-title":"Comput. J."},{"key":"20_CR7","series-title":"LNCS","volume-title":"RAMICS 2011","author":"H. Furusawa","year":"2011","unstructured":"Furusawa, H., Nishizawa, K.: Relational and multirelational representation theorems for complete idempotent left semirings. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol.\u00a06663, Springer, Heidelberg (2011)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-78913-0_10","volume-title":"Relations and Kleene Algebra in Computer Science","author":"H. Furusawa","year":"2008","unstructured":"Furusawa, H., Tsumagari, N., Nishizawa, K.: A non-probabilistic relational model of probabilistic kleene algebras. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS\/AKA 2008. LNCS, vol.\u00a04988, pp. 110\u2013122. Springer, Heidelberg (2008)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR \u201990","author":"R.G. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.G.: The linear time-branching time spectrum (extended abstract). In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 278\u2013297. Springer, Heidelberg (1990)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-04081-8_27","volume-title":"CONCUR 2009 - Concurrency Theory","author":"C.A.R.T. Hoare","year":"2009","unstructured":"Hoare, C.A.R.T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent kleene algebra. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 399\u2013414. Springer, Heidelberg (2009)"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation\u00a0110(2), 366\u2013390 (1994)","journal-title":"Information and Computation"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0029594","volume-title":"Mathematical Foundations of Computer Science 1990","author":"D. Kozen","year":"1990","unstructured":"Kozen, D.: On Kleene algebras and closed semirings. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol.\u00a0452, pp. 26\u201347. Springer, Heidelberg (1990)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Krauss, A., Nipkow, T.: Proof pearl: Regular expression equivalence and relation algebra. Journal of Automated Reasoning (to appear, 2011)","DOI":"10.1007\/s10817-011-9223-4"},{"key":"20_CR14","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":"20_CR15","volume-title":"Abstraction, Refinement and Proof for Probabilistic Systems","author":"A.K. McIver","year":"2005","unstructured":"McIver, A.K., Morgan, C.C.: Abstraction, Refinement and Proof for Probabilistic Systems. Springer, Heidelberg (2005)"},{"key":"20_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/11591191_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A.K. McIver","year":"2005","unstructured":"McIver, A.K., Weber, T.: Towards automated proof support for probabilistic distributed systems. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 534\u2013548. Springer, Heidelberg (2005)"},{"key":"20_CR17","unstructured":"Milner, R.: An algebraic definition of simulation between programs. Tech. rep., Stanford University, Stanford, CA, USA (1971)"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci.\u00a028(3), 439\u2013466 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0055624","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J.J.M.M. Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 194\u2013218. Springer, Heidelberg (1998)"},{"key":"20_CR20","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)"},{"issue":"1\u20132","key":"20_CR21","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. Sci. Comput. Program.\u00a051(1-2), 23\u201345 (2004)","journal-title":"Sci. Comput. Program."}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21070-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T13:07:40Z","timestamp":1560258460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21070-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642210693","9783642210709"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21070-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}