{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:49:58Z","timestamp":1725562198878},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_28","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"393-407","source":"Crossref","is-referenced-by-count":11,"title":["Duality for Labelled Markov Processes"],"prefix":"10.1007","author":[{"given":"Michael","family":"Mislove","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dusko","family":"Pavlovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/inco.1991.9999","volume":"92","author":"S. Abramsky","year":"1991","unstructured":"Abramsky, S.: A Domain Equation for Bisimulation. Information and Computation\u00a092, 161\u2013218 (1991)","journal-title":"Information and Computation"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S0960129500000189","volume":"3","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S., Vickers, S.: Quantales, observational logic and process semantics. Mathematical Structures in Computer Science\u00a03, 161\u2013227 (1993)","journal-title":"Mathematical Structures in Computer Science"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0022-4049(98)00106-6","volume":"143","author":"S. Abramsky","year":"1999","unstructured":"Abramsky, S., Blute, R., Panangaden, P.: Nuclear and Trace Ideals in Tensor-\u2217- categories. Journal of Pure and Applied Algebra\u00a0143, 3\u201347 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45719-4_17","volume-title":"Algebraic Methodology and Software Technology","author":"L. Aceto","year":"2002","unstructured":"Aceto, L., \u00c9sik, Z., Ing\u00f3lfsd\u00f3ttir, A.: Equational Axioms for Probabilistic Bisimilarity. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 239\u2013253. Springer, Heidelberg (2002)"},{"key":"28_CR5","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories","author":"S. Bloom","year":"1993","unstructured":"Bloom, S., Esik, Z.: Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Bloom, S., Esik, Z.: The Equational Logic of Fixed Points. Theoretical Computer Science\u00a0179, 1\u201360","DOI":"10.1016\/S0304-3975(96)00248-4"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-44685-0_23","volume-title":"CONCUR 2001 - Concurrency Theory","author":"F. Breugel van","year":"2001","unstructured":"van Breugel, F., Worrell, J.B.: An algorithm for quantitative verification of probabilistic transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, p. 336. Springer, Heidelberg (2001)"},{"key":"28_CR8","unstructured":"van Breugel, F., Mislove, M., Ouaknine, J., Worrell, J.: Domains, Testing and Similarity for Labelled Markov Processes. To appear in Proceedings of FOSSACS 2003, Theoret. Comp. Sci. (2003)"},{"issue":"2","key":"28_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1006\/inco.2001.2962","volume":"179","author":"J. Desharnais","year":"2002","unstructured":"Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for Labelled Markov Processes. Information and Computation\u00a0179(2), 163\u2013193 (2002)","journal-title":"Information and Computation"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-48320-9_19","volume-title":"CONCUR\u201999. Concurrency Theory","author":"J. Desharnais","year":"1999","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labeled markov systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, p. 258. Springer, Heidelberg (1999)"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S0890-5401(03)00051-8","volume":"184","author":"J. Desharnais","year":"2003","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Approximating Labeled Markov Processes. Information and Computation\u00a0184(1), 160\u2013200 (2003)","journal-title":"Information and Computation"},{"issue":"2","key":"28_CR12","first-page":"145","volume":"8","author":"Z. Esik","year":"2003","unstructured":"Esik, Z., Kuich, W.: Formal Tree Series. Journal of Automata Languages and Combinatorics\u00a08(2), 145\u2013185 (2003)","journal-title":"Journal of Automata Languages and Combinatorics"},{"key":"28_CR13","unstructured":"Naimark, M.A.: Normed Rings, 2nd edn., Nauka, Moscow (1968), reprint of the revised English edition, Wolters-Noordhoff, Groningen (1970)"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R., Smolka, S., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation\u00a0121(1), 59\u201380 (1996)","journal-title":"Information and Computation"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D. Kozen","year":"1981","unstructured":"Kozen, D.: The Semantics of Probabilistic Programs. Journal of Computer and System Science\u00a022, 328\u2013350 (1981)","journal-title":"Journal of Computer and System Science"},{"key":"28_CR16","volume-title":"Stone Spaces","author":"P. Johnstone","year":"1982","unstructured":"Johnstone, P.: Stone Spaces. Cambridge University Press, Cambridge (1982)"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/B978-044482830-9\/50029-1","volume-title":"Handbook of Process Algebra","author":"B. Jonsson","year":"2001","unstructured":"Jonsson, B., Larsen, K., Yi, W.: Probabilistic Extensions of Process Algebras. In: Bergstra, J.A., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 685\u2013710. Elsevier, Amsterdam (2001)"},{"issue":"1","key":"28_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through Probabilistic Testing. Information and Computation\u00a094(1), 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"28_CR19","unstructured":"Mislove, M., Ouaknine, J., Worrell, J.: Axioms for Probability and Nondeterminism. In: Proc. EXPRESS 2003. ENTCS, vol.\u00a091(3) (2003)"},{"key":"28_CR20","volume-title":"Probability Measures on Metric Spaces","author":"K.R. Parthasarathy","year":"1967","unstructured":"Parthasarathy, K.R.: Probability Measures on Metric Spaces. Academic Press, London (1967)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-540-45187-7_33","volume-title":"CONCUR 2003 - Concurrency Theory","author":"A. Pierro Di","year":"2003","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Quantitative Relations and Approximate Process Equivalences. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 508\u2013522. Springer, Heidelberg (2003)"},{"key":"28_CR22","volume-title":"Proof, Language, and Interaction: Essays in Honour of Robin Milner","author":"E.W. Stark","year":"2000","unstructured":"Stark, E.W., Smolka, S.A.: A complete axiom system for finite-state probabilistic processes. In: Proof, Language, and Interaction: Essays in Honour of Robin Milner, MIT Press, Cambridge (2000)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T19:43:03Z","timestamp":1548445383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}