{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:24:34Z","timestamp":1777519474791,"version":"3.51.4"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T00:00:00Z","timestamp":1420416000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We give an algorithm for solving stochastic parity games with almost-sure\nwinning conditions on {\\it lossy channel systems}, under the constraint that\nboth players are restricted to finite-memory strategies. First, we describe a\ngeneral framework, where we consider the class of 2 1\/2-player games with\nalmost-sure parity winning conditions on possibly infinite game graphs,\nassuming that the game contains a {\\it finite attractor}. An attractor is a set\nof states (not necessarily absorbing) that is almost surely re-visited\nregardless of the players' decisions. We present a scheme that characterizes\nthe set of winning states for each player. Then, we instantiate this scheme to\nobtain an algorithm for {\\it stochastic game lossy channel systems}.<\/jats:p>","DOI":"10.2168\/lmcs-10(4:21)2014","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T07:32:47Z","timestamp":1431934367000},"source":"Crossref","is-referenced-by-count":1,"title":["Stochastic Parity Games on Lossy Channel Systems"],"prefix":"10.46298","volume":"Volume 10, Issue 4","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":"25203","published-online":{"date-parts":[[2015,1,5]]},"reference":[{"key":"964:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/944\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/944\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:59:39Z","timestamp":1681243179000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,5]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(4:21)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1410.4448","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1410.4448","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,5]]},"article-number":"944"}}