{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:59:01Z","timestamp":1725742741539},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_29","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T01:54:56Z","timestamp":1374544496000},"page":"338-354","source":"Crossref","is-referenced-by-count":1,"title":["Stochastic Parity Games on Lossy Channel Systems"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Clemente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Sandberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.ic.2005.05.008","volume":"202","author":"P.A. Abdulla","year":"2005","unstructured":"Abdulla, P.A., Bertrand, N., Rabinovich, A., Schnoebelen, P.: Verification of probabilistic systems with faulty communication. Information and Computation\u00a0202(2), 105\u2013228 (2005)","journal-title":"Information and Computation"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45220-1_1","volume-title":"Computer Science Logic","author":"P.A. Abdulla","year":"2003","unstructured":"Abdulla, P.A., Bouajjani, A., d\u2019Orso, J.: Deciding monotonic games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 1\u201314. Springer, Heidelberg (2003)"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation\u00a0160, 109\u2013127 (2000)","journal-title":"Information and Computation"},{"key":"29_CR4","unstructured":"Abdulla, P.A., Clemente, L., Mayr, R., Sandberg, S.: Stochastic parity games on lossy channel systems. Technical Report EDI-INF-RR-1416, University of Edinburgh (2013), http:\/\/arxiv.org\/abs\/1305.5228 , http:\/\/www.inf.ed.ac.uk\/publications\/report\/1416.html"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-78499-9_4","volume-title":"Foundations of Software Science and Computational Structures","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Henda, N.B., de Alfaro, L., Mayr, R., Sandberg, S.: Stochastic games with lossy channels. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 35\u201349. Springer, Heidelberg (2008)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Henda, N.B., Mayr, R.: Decisive Markov chains. Logical Methods in Computer Science\u00a03 (2007)","DOI":"10.2168\/LMCS-3(4:7)2007"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: LICS, pp. 160\u2013170 (1993)","DOI":"10.1109\/LICS.1993.287591"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-36576-1_3","volume-title":"Foundations of Software Science and Computational Structures","author":"P.A. Abdulla","year":"2003","unstructured":"Abdulla, P.A., Rabinovich, A.: Verification of probabilistic systems with faulty communication. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 39\u201353. Springer, Heidelberg (2003)"},{"issue":"1","key":"29_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1297658.1297663","volume":"9","author":"Christel Baier","year":"2007","unstructured":"Baier, C., Bertrand, N., Schnoebelen, P.: Verifying nondeterministic probabilistic channel systems against \u03c9-regular linear-time properties. ACM Trans. on Comp. Logic\u00a09 (2007)","journal-title":"ACM Transactions on Computational Logic"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-36576-1_8","volume-title":"Foundations of Software Science and Computational Structures","author":"N. Bertr","year":"2003","unstructured":"Bertr, N., Schnoebelen, P.: Model checking lossy channels systems is probably decidable. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 120\u2013135. Springer, Heidelberg (2003)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Bertrand, N., Schnoebelen, P.: Solving stochastic b\u00fcchi games on infinite arenas with a finite attractor. In: Proceedings of the 11th International Workshop on Quantitative Aspects of Programming Languages (QAPl 2013), Roma, Italy (to appear March 2013)","DOI":"10.4204\/EPTCS.117.8"},{"key":"29_CR12","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1986","unstructured":"Billingsley, P.: Probability and Measure, 2nd edn. Wiley, New York (1986)","edition":"2"},{"issue":"5","key":"29_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"2","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM\u00a02(5), 323\u2013342 (1983)","journal-title":"Journal of the ACM"},{"key":"29_CR14","unstructured":"Chatterjee, K., de Alfaro, L., Henzinger, T.: Strategy improvement for concurrent reachability games. In: QEST, pp. 291\u2013300. IEEE Computer Society Press (2006)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-45220-1_11","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2003","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 100\u2013113. Springer, Heidelberg (2003)"},{"key":"29_CR16","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (December 1999)"},{"issue":"2","key":"29_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A. Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Information and Computation\u00a096(2), 203\u2013224 (1992)","journal-title":"Information and Computation"},{"key":"29_CR18","unstructured":"de Alfaro, L., Henzinger, T.: Concurrent omega-regular games. In: LICS, Washington - Brussels - Tokyo, pp. 141\u2013156. IEEE (2000)"},{"key":"29_CR19","unstructured":"de Alfaro, L., Henzinger, T., Kupferman, O.: Concurrent reachability games. In: FOCS, pp. 564\u2013575. IEEE Computer Society Press (1998)"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-540-70575-8_58","volume-title":"Automata, Languages and Programming","author":"K. Etessami","year":"2008","unstructured":"Etessami, K., Wojtczak, D., Yannakakis, M.: Recursive stochastic games with positive rewards. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 711\u2013723. Springer, Heidelberg (2008)"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/11523468_72","volume-title":"Automata, Languages and Programming","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov decision processes and recursive stochastic games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 891\u2013903. Springer, Heidelberg (2005)"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive concurrent stochastic games. LMCS\u00a04 (2008)","DOI":"10.2168\/LMCS-4(4:7)2008"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1007\/3-540-45061-0_78","volume-title":"Automata, Languages and Programming","author":"A. Rabinovich","year":"2003","unstructured":"Rabinovich, A.: Quantitative analysis of probabilistic lossy channel systems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1008\u20131021. Springer, Heidelberg (2003)"},{"issue":"10","key":"29_CR24","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. Proceedings of the National Academy of Sciences\u00a039(10), 1095\u20131100 (1953)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: FOCS, pp. 327\u2013338 (1985)","DOI":"10.1109\/SFCS.1985.12"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Wang, K., Li, N., Jiang, Z.: Queueing system with impatient customers: A review. In: IEEE International Conference on Service Operations and Logistics and Informatics (SOLI), pp. 82\u201387. IEEE (2010)","DOI":"10.1109\/SOLI.2010.5551611"},{"key":"29_CR27","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. TCS\u00a0200, 135\u2013183 (1998)","journal-title":"TCS"}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T03:42:47Z","timestamp":1563507767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40196-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401954","9783642401961"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40196-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}