{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:28:47Z","timestamp":1725470927169},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540459019"},{"type":"electronic","value":"9783540459026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11881070_118","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T05:35:07Z","timestamp":1158903307000},"page":"893-902","source":"Crossref","is-referenced-by-count":0,"title":["Simulation for Interactive Markov Chains"],"prefix":"10.1007","author":[{"given":"Xiying","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinzhao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"118_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1999.1683","volume":"60","author":"C. Baier","year":"2000","unstructured":"Baier, C., Engelen, B., Majster-Cederbaum, M.: Deciding bisimilarity and similarity for probabilistic process. J. of Comp. and System Sc.\u00a060(1), 187\u2013231 (2000)","journal-title":"J. of Comp. and System Sc."},{"key":"118_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. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 492\u2013507. Springer, Heidelberg (2003)"},{"key":"118_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-63166-6_14","volume-title":"Computer-Aided verification","author":"C. Baier","year":"1997","unstructured":"Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic system. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 119\u2013130. Springer, Heidelberg (1997)"},{"key":"118_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-45694-5_23","volume-title":"CONCUR 2002 - Concurrency Theory","author":"C. Baier","year":"2002","unstructured":"Baier, C., Katoen, J.-P., Hermanns, H., Haverkort, B.: Simulation for continuous-time Markov chains. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 338\u2013354. Springer, Heidelberg (2002)"},{"issue":"6","key":"118_CR5","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TSE.2003.1205180","volume":"29","author":"C. Baier","year":"2003","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Software Eng\u00a029(6), 524\u2013541 (2003)","journal-title":"IEEE Trans. Software Eng"},{"issue":"4","key":"118_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1059816.1059819","volume":"32","author":"C. Baier","year":"2005","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model checking meets performance evaluation. SIGMETRICS Performance Evaluation Review\u00a032(4), 10\u201315 (2005)","journal-title":"SIGMETRICS Performance Evaluation Review"},{"key":"118_CR7","unstructured":"Bravetti, M.: Revisting interactive Markov chains. In: Vogler, W., Larsen, K.G. (eds.) Models for Time-Critical Systems. BRICS Notes Series NS-02-3, pp. 60\u201380 (2002)"},{"key":"118_CR8","first-page":"165","volume-title":"Fundamental Results for the Verification of Observational Equivalence: a Survey, Protocl Specification, Testing and Verification","author":"T. Bolognesi","year":"1987","unstructured":"Bolognesi, T., Smolka, S.: Fundamental Results for the Verification of Observational Equivalence: a Survey, Protocl Specification, Testing and Verification, pp. 165\u2013179. Elsevier Science Publishers, Amsterdam (1987)"},{"key":"118_CR9","first-page":"287","volume-title":"A Semantics-Based Verification Tool for Finite State Systems, Protocl Specification, Testing and Verification IX","author":"R. Cleaveland","year":"1990","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: A Semantics-Based Verification Tool for Finite State Systems, Protocl Specification, Testing and Verification IX, pp. 287\u2013302. Elsevier Science Publishers, Amsterdam (1990)"},{"key":"118_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46002-0_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Gentilini","year":"2002","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Simulation as Coarsest Partition Problem. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol.\u00a02280, Springer, Heidelberg (2002)"},{"key":"118_CR11","unstructured":"Hermanns, H., Meyer-Kayser, J., Siegle, M.: Multi-terminal binary decision diagrams to represent and analyse continuous-time Markov chains (1999)"},{"key":"118_CR12","unstructured":"Hermanns, H.: Interactive Markov chains. PhD thesis, Universit\u00e4t Erlangen-N\u00fcrnberg (1998)"},{"key":"118_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-44685-0_6","volume-title":"CONCUR 2001 - Concurrency Theory","author":"H. Hermanns","year":"2001","unstructured":"Hermanns, H., Katoen, J.-P.: Performance evaluation: =(process algebra + model checking ) Markov chains. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 59\u201381. Springer, Heidelberg (2001)"},{"key":"118_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-40911-4_24","volume-title":"Integrated Formal Methods","author":"H. Hermanns","year":"2000","unstructured":"Hermanns, H., Katoen, J.-P., Meyer-Kayser, J., Siegle, M.: Towards model checking stochastic process algebra. In: IFM 2000. LNCS, vol.\u00a01945, pp. 239\u2013420. Springer, Heidelberg (2000)"},{"key":"118_CR15","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Henzinger, T., Kopke, P.: Computing Simulations on Finite and Infinite Graphs. In: Proc. FOCS 1995, pp. 43\u2013462 (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"key":"118_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/3-540-54430-5_99","volume-title":"CONCUR 1991","author":"B. Jonsson","year":"1991","unstructured":"Jonsson, B.: Simulations between specifications of distributed systems. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, pp. 346\u2013360. Springer, Heidelberg (1991)"},{"key":"118_CR17","first-page":"87","volume":"3","author":"A. Jensen","year":"1953","unstructured":"Jensen, A.: Markov chains as an aid in the study of Markov process. Skand. Aktuarietidskrift\u00a03, 87\u201391 (1953)","journal-title":"Skand. Aktuarietidskrift"},{"key":"118_CR18","doi-asserted-by":"crossref","unstructured":"Kannelakis, P., Smolka, S.: CCS Expressions, Finite State Processes and Three Problems of Equivalenec. In: Kannelakis, P., Smolka, S. (eds.) Proc. 2nd ACM Symposium on the Pronciples of Distributed Computating, pp. 228\u2013240 (1983)","DOI":"10.1145\/800221.806724"},{"issue":"1","key":"118_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1992","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. and Comp.\u00a094(1), 1\u201328 (1992)","journal-title":"Inf. and Comp."},{"key":"118_CR20","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"118_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-44618-4_25","volume-title":"CONCUR 2000 - Concurrency Theory","author":"A. Philippou","year":"2000","unstructured":"Philippou, A., Lee, I., Sokolsky, O.: Weak bisimulation for probabilistic systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 334\u2013349. Springer, Heidelberg (2000)"},{"issue":"6","key":"118_CR22","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM Journal of Computing\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM Journal of Computing"},{"key":"118_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-540-30233-9_12","volume-title":"FORTE Workshops","author":"G. Qin","year":"2004","unstructured":"Qin, G., Wu, J.: Branching time equivlences for interactive Markov chains. In: N\u00fa\u00f1ez, M., Maamar, Z., Pelayo, F.L., Pousttchi, K., Rubio, F. (eds.) FORTE 2004. LNCS, vol.\u00a03236, pp. 156\u2013169. Springer, Heidelberg (2004)"},{"key":"118_CR24","series-title":"Lecture Notes in Computer Science","first-page":"492","volume-title":"CONCUR 1994: Concurrency Theory","author":"R. Segala.","year":"1994","unstructured":"Segala., R., Lynch, N.: Probabilistic Simulations for Probabilistic Processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 492\u2013493. Springer, Heidelberg (1994)"},{"key":"118_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-45319-9_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Tan","year":"2001","unstructured":"Tan, L., Cleaveland, R.: Simulation revisited. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol.\u00a02031, pp. 480\u2013495. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11881070_118.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:50:17Z","timestamp":1605624617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11881070_118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540459019","9783540459026"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11881070_118","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}