{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T20:52:49Z","timestamp":1674507169108},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9177,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0304-3975(88)90031-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"263-324","source":"Crossref","is-referenced-by-count":6,"title":["On the complexity of deciding fair termination of probabilistic concurrent finite-state programs"],"prefix":"10.1016","volume":"58","author":[{"given":"Louis E.","family":"Rosier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90031-X_BIB1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/62.322433","article-title":"Some combinatorial game problems require \u03a9(nk) time","volume":"31","author":"Adachi","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90031-X_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90031-X_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(88)90031-X_BIB4","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/2166.357214","article-title":"Termination of probabilistic concurrent programs","volume":"5","author":"Hart","year":"1983","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/0304-3975(88)90031-X_BIB5","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1137\/0213021","article-title":"Verification of probabilistic systems","volume":"13","author":"Hart","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90031-X_BIB6","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(88)90031-X_BIB7","first-page":"161","article-title":"Problem requiring k log n deterministic space","volume":"44","author":"Iwata","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/0304-3975(88)90031-X_BIB8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90031-X_BIB9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01699467","article-title":"Gradually intractable problems and nondeterministic log-space lower bounds","volume":"18","author":"Kasai","year":"1985","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(88)90031-X_BIB10","series-title":"Denumerable Markov Chains","author":"Kemeny","year":"1966"},{"key":"10.1016\/0304-3975(88)90031-X_BIB11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(80)90033-1","article-title":"The complexity of problems in systems of communicating sequential processes","volume":"21","author":"Ladner","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90031-X_BIB12","series-title":"Proc. Internat Conf. on Automata, Languages and Programming","first-page":"264","article-title":"Impartiality, justice and fairness: the ethics of concurrent termination","volume":"115","author":"Lehmann","year":"1981"},{"key":"10.1016\/0304-3975(88)90031-X_BIB13","first-page":"133","article-title":"On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem","author":"Lehmann","year":"1981","journal-title":"Proc. 10th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(88)90031-X_BIB14","first-page":"97","article-title":"Checking that finite state concurrent programs satisfy their linear specification","author":"Lichtenstein","year":"1985","journal-title":"Proc. 12th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(88)90031-X_BIB15","first-page":"278","article-title":"On the extremely fair treatment of probabilistic algorithms","author":"Pnueli","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90031-X_BIB16","first-page":"407","article-title":"N-process synchronization by 4 log2N-valued shared variable","author":"Rabin","year":"1980","journal-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90031-X_BIB17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00288965","article-title":"The choice coordination problem","volume":"17","author":"Rabin","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(88)90031-X_BIB18","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","article-title":"A multiparameter analysis of the boundedness problem for vector addition systems","volume":"32","author":"Rosier","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90031-X_BIB19","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1137\/0216052","article-title":"Logspace hierarchies, polynomial time and the complexity of fairness problems concerning \u03c9-machines","volume":"16","author":"Rosier","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90031-X_BIB20","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0022-0000(84)90066-7","article-title":"Space-bounded hierarchies and probabilistic computations","volume":"28","author":"Ruzzo","year":"1984","journal-title":"J. Comput. System Sci"},{"key":"10.1016\/0304-3975(88)90031-X_BIB21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0022-0000(77)80041-X","article-title":"Techniques for separating space complexity classes","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90031-X_BIB22","first-page":"327","article-title":"Automatic verification of probabilistic concurrent finite-state programs","author":"Vardi","year":"1985","journal-title":"Proc. 26th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90031-X_BIB23","first-page":"100","article-title":"A Turing machine space hierarchy","volume":"15","author":"Zak","year":"1979","journal-title":"Kybernet."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758890031X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758890031X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:53:45Z","timestamp":1555113225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758890031X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["030439758890031X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90031-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}