{"id":"https://openalex.org/W2077620037","doi":"https://doi.org/10.1016/0304-3975(88)90031-x","title":"On the complexity of deciding fair termination of probabilistic concurrent finite-state programs","display_name":"On the complexity of deciding fair termination of probabilistic concurrent finite-state programs","publication_year":1988,"publication_date":"1988-06-01","ids":{"openalex":"https://openalex.org/W2077620037","doi":"https://doi.org/10.1016/0304-3975(88)90031-x","mag":"2077620037"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(88)90031-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(88)90031-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109151333","display_name":"Louis E. Rosier","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Louis E. Rosier","raw_affiliation_strings":["Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712, U.S.A.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712, U.S.A.#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101878939","display_name":"Hsu\u2010Chun Yen","orcid":"https://orcid.org/0000-0002-1764-1950"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsu-Chun Yen","raw_affiliation_strings":["Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712, U.S.A.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712, U.S.A.#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":{"value":2880,"currency":"USD","value_usd":2880},"apc_paid":null,"fwci":2.6301,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.90405904,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"58","issue":"1-3","first_page":"263","last_page":"324"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.711027979850769},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6503421068191528},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6298524141311646},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6250803470611572},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6212752461433411},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5792040228843689},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5630131363868713},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5368056893348694},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.484350323677063},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48401567339897156},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4699096083641052},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4487329423427582},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42786264419555664},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.26529639959335327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10830119252204895}],"concepts":[{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.711027979850769},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6503421068191528},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6298524141311646},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6250803470611572},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6212752461433411},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5792040228843689},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5630131363868713},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5368056893348694},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.484350323677063},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48401567339897156},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4699096083641052},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4487329423427582},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42786264419555664},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26529639959335327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10830119252204895},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(88)90031-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(88)90031-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W195745644","https://openalex.org/W1538639190","https://openalex.org/W1798280647","https://openalex.org/W1986355834","https://openalex.org/W1999647826","https://openalex.org/W2001097638","https://openalex.org/W2002089154","https://openalex.org/W2007706420","https://openalex.org/W2010217280","https://openalex.org/W2011039300","https://openalex.org/W2012539169","https://openalex.org/W2015797339","https://openalex.org/W2018908462","https://openalex.org/W2055454967","https://openalex.org/W2064968744","https://openalex.org/W2066238373","https://openalex.org/W2074199912","https://openalex.org/W2082612358","https://openalex.org/W2090398333","https://openalex.org/W2091188761","https://openalex.org/W2165161585","https://openalex.org/W2395895426","https://openalex.org/W4232661759","https://openalex.org/W4241108585","https://openalex.org/W4302339081","https://openalex.org/W6638298327","https://openalex.org/W6654541566","https://openalex.org/W6655089678","https://openalex.org/W6672986038","https://openalex.org/W6684551565","https://openalex.org/W6711941183"],"related_works":["https://openalex.org/W2154884611","https://openalex.org/W2005440350","https://openalex.org/W2161147766","https://openalex.org/W1504200807","https://openalex.org/W2162198520","https://openalex.org/W3183391041","https://openalex.org/W2164683439","https://openalex.org/W1545342196","https://openalex.org/W2075130353","https://openalex.org/W2077620037"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}