{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:54:10Z","timestamp":1762458850285},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152399"},{"type":"electronic","value":"9783642152405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15240-5_6","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T15:30:15Z","timestamp":1280935815000},"page":"71-85","source":"Crossref","is-referenced-by-count":6,"title":["On Probabilistic Alternating Simulations"],"prefix":"10.1007","author":[{"given":"Chenyi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"100","volume-title":"Proc. FOCS","author":"R. Alur","year":"1997","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. In: Proc. FOCS, pp. 100\u2013109. IEEE CS, Los Alamitos (1997)"},{"issue":"5","key":"6_CR2","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. J. ACM\u00a049(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"6_CR3","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)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-642-04444-1_35","volume-title":"Computer Security \u2013 ESORICS 2009","author":"M. Aizatulin","year":"2009","unstructured":"Aizatulin, M., Schnoor, H., Wilke, T.: Computationally sound analysis of a probabilistic contract signing protocol. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol.\u00a05789, pp. 571\u2013586. Springer, Heidelberg (2009)"},{"issue":"1","key":"6_CR5","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. J. Comput. Syst. Sci.\u00a060(1), 187\u2013231 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1145\/1109557.1109631","volume-title":"Proc. SODA","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of quantitative concurrent parity games. In: Proc. SODA, pp. 678\u2013687. ACM, New York (2006)"},{"key":"6_CR7","first-page":"35","volume-title":"Proc. FSKD","author":"T. Chen","year":"2007","unstructured":"Chen, T., Lu, J.: Probabilistic alternating-time temporal logic and model checking algorithm. In: Proc. FSKD, pp. 35\u201339. IEEE CS, Los Alamitos (2007)"},{"key":"6_CR8","first-page":"564","volume-title":"Proc. FOCS","author":"L. Alfaro de","year":"1998","unstructured":"de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. In: Proc. FOCS, pp. 564\u2013575. IEEE CS, Los Alamitos (1998)"},{"issue":"2","key":"6_CR9","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. J. Comput. Syst. Sci.\u00a068(2), 374\u2013397 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45694-5_24","volume-title":"CONCUR 2002 - Concurrency Theory","author":"J. Desharnais","year":"2002","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Weak bisimulation is sound and complete for PCTL\u2009\u22c6\u2009. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 355\u2013370. Springer, Heidelberg (2002)"},{"key":"6_CR11","first-page":"955","volume-title":"Handbook of Theoretical Computer Science (B)","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science (B), pp. 955\u20131072. MIT Press, Cambridge (1990)"},{"key":"6_CR12","volume-title":"Time and Probability in Formal Design of Distributed Systems","author":"H. Hansson","year":"1994","unstructured":"Hansson, H.: Time and Probability in Formal Design of Distributed Systems. Elsevier, Amsterdam (1994)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1137\/S0097539704446487","volume":"37","author":"N.A. Lynch","year":"2007","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W.: Observing branching structure through probabilistic contexts. SIAM J. Comput.\u00a037(4), 977\u20131013 (2007)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.2307\/2586667","volume":"63","author":"D.A. Martin","year":"1998","unstructured":"Martin, D.A.: The determinacy of Blackwell games. J. Symb. Log.\u00a063(4), 1565\u20131581 (1998)","journal-title":"J. Symb. Log."},{"key":"6_CR15","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"6_CR16","volume-title":"Theory of Games and Economic Behavior","author":"J. Neumann von","year":"1947","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1947)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-71389-0_21","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Parma","year":"2007","unstructured":"Parma, A., Segala, R.: Logical characterizations of bisimulations for discrete probabilistic systems. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 287\u2013301. Springer, Heidelberg (2007)"},{"issue":"6","key":"6_CR18","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF01415989","volume":"35","author":"T.E.S. Raghavan","year":"1991","unstructured":"Raghavan, T.E.S., Filar, J.A.: Algorithms for stochastic games \u2013 A survey. Mathematical Methods of Operations Research\u00a035(6), 437\u2013472 (1991)","journal-title":"Mathematical Methods of Operations Research"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-60218-6_17","volume-title":"CONCUR \u201995 Concurrency Theory","author":"R. Segala","year":"1995","unstructured":"Segala, R.: A compositional trace-based semantics for probabilistic automata. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 234\u2013248. Springer, Heidelberg (1995)"},{"key":"6_CR20","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT (1995)"},{"issue":"2","key":"6_CR21","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nord. J. Comput.\u00a02(2), 250\u2013273 (1995)","journal-title":"Nord. J. Comput."},{"key":"6_CR22","first-page":"133","volume-title":"Handbook of Theoretical Computer Science (B)","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science (B), pp. 133\u2013192. MIT Press, Cambridge (1990)"},{"key":"6_CR23","unstructured":"Zhang, C., Pang, J.: On probabilistic alternating simulations. Tech. Rep .(2010), \n                  \n                    http:\/\/arxiv.org\/abs\/1003.0788"}],"container-title":["IFIP Advances in Information and Communication Technology","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15240-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:49:29Z","timestamp":1619786969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15240-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152399","9783642152405"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15240-5_6","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2010]]}}}