{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:22:43Z","timestamp":1776316963184,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422877","type":"print"},{"value":"9783540482246","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_35","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"421-432","source":"Crossref","is-referenced-by-count":36,"title":["Towards Quantitative Verification of Probabilistic Transition Systems"],"prefix":"10.1007","author":[{"given":"Franck","family":"van Breugel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"35_CR1","volume-title":"Real Analysis and Probability","author":"R.B. Ash","year":"1972","unstructured":"R.B. Ash. Real Analysis and Probability, Academic Press, London, 1972."},{"issue":"1\/2","key":"35_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(95)00015-O","volume":"146","author":"F. Alessi","year":"1995","unstructured":"F. Alessi, P. Baldan and G. Bell\u00e8. A Fixed-Point Theorem in a Category of Compact Metric Spaces. Theoretical Computer Science, 146(1\/2):311\u2013320, July 1995.","journal-title":"Theoretical Computer Science"},{"key":"35_CR3","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings of the 4th International Workshop on Expressiveness in Concurrency","author":"C. Baier","year":"1997","unstructured":"C. Baier and M. Kwiatkowska. Domain Equations for Probabilistic Processes. In Proceedings of the 4th International Workshop on Expressiveness in Concurrency, volume 7 of Electronic Notes in Theoretical Computer Science, Santa Margherita Ligure, September 1997, Elsevier."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"F. van Breugel and J. Worrell. An Algorithm for Quantitative Verification of Probabilistic Transition Systems. Report CS-2001-01, York University, Toronto, April 2001.","DOI":"10.1007\/3-540-44685-0_23"},{"key":"35_CR5","first-page":"478","volume-title":"Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science","author":"J. Desharnais","year":"1988","unstructured":"J. Desharnais, A. Edalat and P. Panangaden. A Logical Characterization of Bisimulation for Labelled Markov Processes. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, pages 478\u2013487, Indianapolis, 1988. IEEE."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"J. Desharnais, A. Edalat and P. Panangaden. Bisimulation for Labelled Markov Processes. Information and Computation, to appear.","DOI":"10.1006\/inco.2001.2962"},{"key":"35_CR7","series-title":"Lect. Notes in Comp. Sci","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/3-540-48320-9_19","volume-title":"Proceedings of the 10th International Conference on Concurrency Theory","author":"J. Desharnais","year":"1999","unstructured":"J. Desharnais, V. Gupta, R. Jagadeesan and P. Panangaden. Metrics for Labelled Markov Systems. In Proceedings of the 10th International Conference on Concurrency Theory, vol. 1664 of Lect. Notes in Comp. Sci, pages 258\u2013273, Eindhoven, August 1999. Springer-Verlag."},{"key":"35_CR8","first-page":"95","volume-title":"Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science","author":"J. Desharnais","year":"2000","unstructured":"J. Desharnais, V. Gupta, R. Jagadeesan and P. Panangaden. Approximating Labelled Markov Processes. In Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, pages 95\u2013106, Santa Barbara, June 2000. IEEE."},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"G.A. Edgar. Integral, Probability, and Fractal Measures, Springer-Verlag, 1998.","DOI":"10.1007\/978-1-4757-2958-0"},{"key":"35_CR10","unstructured":"A. Giacalone, C.C. Jou and S.A. Smolka. Algebraic Reasoning for Probabilistic Concurrent Systems. In Proceedings of the IFIP WG 2.2\/2.3 Working Conference on Programming Concepts and Methods, pages 443\u2013458, Sea of Galilee, April 1990, North-Holland."},{"key":"35_CR11","series-title":"Lect. Notes in Math.","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0092872","volume-title":"Proceedings of the International Conference on Categorical Aspects of Topology and Analysis","author":"M. Giry","year":"1981","unstructured":"M. Giry. A Categorical Approach to Probability Theory. In Proceedings of the International Conference on Categorical Aspects of Topology and Analysis, volume 915 of Lect. Notes in Math., pages 68\u201385, Ottawa, 1981, Springer-Verlag."},{"key":"35_CR12","unstructured":"J.I. den Hartog. Comparative Semantics for a Process Language with Probabilistic Choice and Non-Determinism, Report IR-445, Free University, Amsterdam, 1998."},{"key":"35_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/LICS.1997.614940","volume-title":"Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science","author":"M. Huth","year":"1997","unstructured":"M. Huth and M. Kwiatkowska. Quantitative Analysis and Model Checking. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pages 111\u2013122, Warsaw, June\/July 1997. IEEE."},{"issue":"5","key":"35_CR14","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1512\/iumj.1981.30.30055","volume":"30","author":"J.E. Hutchinson","year":"1981","unstructured":"J.E. Hutchinson. Fractals and Self Similarity. Indiana University Mathematics Journal, 30(5):713\u2013747, 1981.","journal-title":"Indiana University Mathematics Journal"},{"issue":"2","key":"35_CR15","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0022-0000(85)90012-1","volume":"30","author":"D. Kozen","year":"1985","unstructured":"D. Kozen. A Probabilistic PDL. Journal of Computer and System Sciences, 30(2):162\u2013178, April 1985.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"K.G. Larsen and A. Skou. Bisimulation through Probabilistic Testing. Information and Computation, 94(1):1\u201328, September 1991.","journal-title":"Information and Computation"},{"key":"35_CR17","unstructured":"G.J. Norman. Metric Semantics for Reactive Probabilistic Systems. PhD thesis, University of Birmingham, 1997."},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"K.R. Parthasarathy. Probability Measures on Metric Spaces. Academic Press, 1967.","DOI":"10.1016\/B978-1-4832-0022-4.50006-5"},{"issue":"1","key":"35_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.J.M. Rutten","year":"2000","unstructured":"J.J.J.M. Rutten. Universal Coalgebra: a Theory of Systems, Theoretical Computer Science, 249(1), pages 3\u201380, October 2000.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"35_CR20","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0960129598002588","volume":"8","author":"D. Turi","year":"1998","unstructured":"D. Turi and J.J.M.M. Rutten. On the Foundations of Final Semantics: non-standard sets, metric spaces, partial orders. Mathematical Structures in Computer Science, 8(5):481\u2013540, October 1998.","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1\/2","key":"35_CR21","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0304-3975(99)00035-3","volume":"221","author":"E.P. Vink de","year":"1999","unstructured":"E.P. de Vink and J.J.M.M. Rutten. Bisimulation for Probabilistic Transition Systems: a Coalgebraic Approach. Theoretical Computer Science, 221(1\/2):271\u2013293, June 1999.","journal-title":"Theoretical Computer Science"},{"key":"35_CR22","unstructured":"J. Worrell. On Coalgebras and Final Semantics. PhD thesis, Oxford University, 2000."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:28:03Z","timestamp":1556922483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}