{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:55Z","timestamp":1760202655051},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401954"},{"type":"electronic","value":"9783642401961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40196-1_18","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:54:56Z","timestamp":1374530096000},"page":"209-224","source":"Crossref","is-referenced-by-count":3,"title":["Revisiting Weak Simulation for Substochastic Markov Chains"],"prefix":"10.1007","author":[{"given":"David N.","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Lei","family":"Song","sequence":"additional","affiliation":[]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science\u00a082(2), 253\u2013284 (1991)","journal-title":"Theoretical Computer Science"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-45187-7_32","volume-title":"CONCUR 2003 - Concurrency Theory","author":"C. Baier","year":"2003","unstructured":"Baier, C., Hermanns, H., Katoen, J.-P., Wolf, V.: Comparative branching-time semantics for Markov chains (extended abstract). In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 492\u2013507. Springer, Heidelberg (2003)"},{"key":"18_CR3","volume-title":"Principles of model checking","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of model checking. MIT Press, Cambridge (2008)"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ic.2005.03.001","volume":"200","author":"C. Baier","year":"2005","unstructured":"Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Information and Computation\u00a0200(2), 149\u2013214 (2005)","journal-title":"Information and Computation"},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R. Nicola De","year":"1995","unstructured":"De Nicola, R., Vaandrager, F.: Three logics for branching bisimulation. Journal of the ACM\u00a042(2), 458\u2013487 (1995)","journal-title":"Journal of the ACM"},{"key":"18_CR6","unstructured":"Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes, \n                    \n                      http:\/\/www.cse.unsw.edu.au\/~rvg\/pub\/finitary.pdf\n                    \n                    \n                  , an extended abstract has been published as [7]"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-04081-8_19","volume-title":"CONCUR 2009 - Concurrency Theory","author":"Y. Deng","year":"2009","unstructured":"Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes (extended abstract). In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 274\u2013288. Springer, Heidelberg (2009)"},{"issue":"1","key":"18_CR8","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 labelled Markov processes. Information and Computation\u00a0184(1), 160\u2013200 (2003)","journal-title":"Information and Computation"},{"key":"18_CR9","first-page":"264","volume-title":"QEST 2008","author":"J. Desharnais","year":"2008","unstructured":"Desharnais, J., Laviolette, F., Tracol, M.: Approximate analysis of probabilistic processes: Logic, simulation and games. In: QEST 2008, pp. 264\u2013273. IEEE Computer Society, Los Alamitos (2008)"},{"key":"18_CR10","first-page":"342","volume-title":"25th Annual IEEE Symposium on Logic in Computer Science: LICS","author":"C. Eisentraut","year":"2010","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: 25th Annual IEEE Symposium on Logic in Computer Science: LICS, pp. 342\u2013351. IEEE Computer Society, Los Alamitos (2010)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Jansen, D.N., Song, L., Zhang, L.: Revisiting weak simulation for substochastic Markov chains. Tech. Rep. ICIS\u2013R13005, Radboud Universiteit, Nijmegen (2013), \n                    \n                      http:\/\/www.cs.ru.nl\/research\/reports","DOI":"10.1007\/978-3-642-40196-1_18"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/LICS.1991.151651","volume-title":"Sixth Annual IEEE Symposium on Logic in Computer Science (LICS)","author":"B. Jonsson","year":"1991","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Sixth Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 266\u2013277. IEEE Computer Society, Los Alamitos (1991)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-642-27940-9_26","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"J. Sack","year":"2012","unstructured":"Sack, J., Zhang, L.: A general framework for probabilistic characterizing formulae. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol.\u00a07148, pp. 396\u2013411. Springer, Heidelberg (2012)"},{"key":"18_CR14","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge (1996)"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics\u00a05(2), 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"},{"key":"18_CR16","unstructured":"Zhang, L.: Decision Algorithms for Probabilistic Simulations. Ph.D. thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken (2008)"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40196-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:53:49Z","timestamp":1557960829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40196-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401954","9783642401961"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40196-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}