{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:14:49Z","timestamp":1768342489310,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642276590","type":"print"},{"value":"9783642276606","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_35","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T15:14:28Z","timestamp":1326726868000},"page":"431-442","source":"Crossref","is-referenced-by-count":3,"title":["An Algorithm for Probabilistic\u00a0Alternating\u00a0Simulation"],"prefix":"10.1007","author":[{"given":"Chenyi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"35_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of ACM\u00a049(5), 672\u2013713 (2002)","journal-title":"Journal of ACM"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0055622","volume-title":"CONCUR \u201998 Concurrency Theory","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating Refinement Relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 163\u2013178. Springer, Heidelberg (1998)"},{"issue":"1","key":"35_CR3","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.E.: Deciding bisimilarity and similarity for probabilistic processes. Journal of Computer and System Sciences\u00a060(1), 187\u2013231 (2000)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"35_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 Transactions on Computational Logic\u00a04(2), 181\u2013206 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45694-5_25","volume-title":"CONCUR 2002 - Concurrency Theory","author":"S. Cattani","year":"2002","unstructured":"Cattani, S., Segala, R.: Decision Algorithms for Probabilistic Bisimulation. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 371\u2013386. Springer, Heidelberg (2002)"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of quantitative concurrent parity games. In: Proc. SODA, pp. 678\u2013687. ACM (2006)","DOI":"10.1145\/1109557.1109631"},{"issue":"3:13","key":"35_CR7","first-page":"1","volume":"6","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., de Alfaro, L., Majumdar, R., Raman, V.: Algorithms for game metrics (full version). Logical Methods in Computer Science\u00a06(3:13), 1\u201327 (2010)","journal-title":"Logical Methods in Computer Science"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Synthesis of Synchronization Skeletons for Branching-Time Temporal Logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-45187-7_7","volume-title":"CONCUR 2003 - Concurrency Theory","author":"L. Alfaro de","year":"2003","unstructured":"de Alfaro, L.: Quantitative Verification and Control Via the Mu-Calculus. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 103\u2013127. Springer, Heidelberg (2003)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. In: Proc. FOCS, pp. 564\u2013575. IEEE CS (1998)","DOI":"10.1109\/SFCS.1998.743507"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.jcss.2003.07.009","volume":"68","author":"L. Alfaro de","year":"2004","unstructured":"de Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. Journal of Computer and System Sciences\u00a068(2), 374\u2013397 (2004)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3:7","key":"35_CR12","first-page":"1","volume":"4","author":"L. de Alfaro","year":"2008","unstructured":"de Alfaro, L., Majumdar, R., Raman, V., Stoelinga, M.: Game refinement relations and metrics. Logic Methods in Computer Science\u00a04(3:7), 1\u201328 (2008)","journal-title":"Logic Methods in Computer Science"},{"issue":"1","key":"35_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1027328830731","volume":"31","author":"R. Gentilini","year":"2003","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: Coarsest partition problems. Journal of Automatic Reasoning\u00a031(1), 73\u2013103 (2003)","journal-title":"Journal of Automatic Reasoning"},{"issue":"3","key":"35_CR14","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O. Grumberg","year":"1994","unstructured":"Grumberg, O., Long, D.: Model checking and modular verification. ACM Transactions on Programming Languages and Systems\u00a016(3), 843\u2013871 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proc. FOCS, pp. 453\u2013462. IEEE CS (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proc. LICS, pp. 266\u2013277. IEEE CS (1991)","DOI":"10.1109\/LICS.1991.151651"},{"issue":"4","key":"35_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmakar","year":"1984","unstructured":"Karmakar, N.: A new polynomial-time algorithm for linear programming. Combinatorica\u00a04(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Ranzato, F., Tapparo, F.: A new efficient simulation equivalence algorithm. In: Proc. LICS, pp. 171\u2013180. IEEE CS (2007)","DOI":"10.1109\/LICS.2007.8"},{"key":"35_CR19","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology (1995)"},{"issue":"2","key":"35_CR20","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing\u00a02(2), 250\u2013273 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"35_CR21","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"L.S. Shapley","year":"1953","unstructured":"Shapley, L.S.: Stochastic games. Proc. National Academy of Science\u00a039, 1095\u20131100 (1953)","journal-title":"Proc. National Academy of Science"},{"key":"35_CR22","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.) TACAS 2001. LNCS, vol.\u00a02031, pp. 480\u2013495. Springer, Heidelberg (2001)"},{"key":"35_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-540-70545-1_49","volume-title":"Computer Aided Verification","author":"R.J. Glabbeek van","year":"2008","unstructured":"van Glabbeek, R.J., Ploeger, B.: Correcting a Space-Efficient Simulation Algorithm. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 517\u2013529. Springer, Heidelberg (2008)"},{"key":"35_CR24","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press (1947)"},{"key":"35_CR25","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-15240-5_6","volume-title":"Theoretical Computer Science","author":"C. Zhang","year":"2010","unstructured":"Zhang, C., Pang, J.: On Probabilistic Alternating Simulations. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 71\u201385. Springer, Heidelberg (2010)"},{"key":"35_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-85361-9_22","volume-title":"CONCUR 2008 - Concurrency Theory","author":"L. Zhang","year":"2008","unstructured":"Zhang, L.: A Space-Efficient Probabilistic Simulation Algorithm. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 248\u2013263. Springer, Heidelberg (2008)"},{"issue":"4:6","key":"35_CR27","first-page":"1","volume":"4","author":"L. Zhang","year":"2008","unstructured":"Zhang, L., Hermanns, H., Eisenbrand, F., Jansen, D.N.: Flow faster: Efficient decision algorithms for probabilistic simulations. Logical Methods in Computer Science\u00a04(4:6), 1\u201343 (2008)","journal-title":"Logical Methods in Computer Science"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T21:48:57Z","timestamp":1742334537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}