{"id":"https://openalex.org/W2036472753","doi":"https://doi.org/10.1016/s0022-0000(03)00005-9","title":"The complexity of the temporal logic with \u201cuntil\u201d over general linear time","display_name":"The complexity of the temporal logic with \u201cuntil\u201d over general linear time","publication_year":2003,"publication_date":"2003-03-01","ids":{"openalex":"https://openalex.org/W2036472753","doi":"https://doi.org/10.1016/s0022-0000(03)00005-9","mag":"2036472753"},"language":"en","primary_location":{"id":"doi:10.1016/s0022-0000(03)00005-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(03)00005-9","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"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":"Journal of Computer and System Sciences","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/A5036930915","display_name":"Mark Reynolds","orcid":"https://orcid.org/0000-0002-5415-0544"},"institutions":[{"id":"https://openalex.org/I176790772","display_name":"Murdoch University","ror":"https://ror.org/00r4sry34","country_code":"AU","type":"education","lineage":["https://openalex.org/I176790772"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"M. Reynolds","raw_affiliation_strings":["School of Information Technology, Murdoch University, Murdoch, Perth, Western Australia 6150, Australia","School of Information Technology, Murdoch University, Murdoch, Perth, Western Australia 6150, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, Murdoch University, Murdoch, Perth, Western Australia 6150, Australia","institution_ids":["https://openalex.org/I176790772"]},{"raw_affiliation_string":"School of Information Technology, Murdoch University, Murdoch, Perth, Western Australia 6150, Australia#TAB#","institution_ids":["https://openalex.org/I176790772"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036930915"],"corresponding_institution_ids":["https://openalex.org/I176790772"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":null,"fwci":4.7248,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.95258161,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"66","issue":"2","first_page":"393","last_page":"426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/linear-temporal-logic","display_name":"Linear temporal logic","score":0.7921693921089172},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6997487545013428},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6990199089050293},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5783600211143494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5717147588729858},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.5607208609580994},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.4458923935890198},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.43233931064605713},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3881685733795166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3619409501552582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.345969021320343},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3326342701911926},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2971264719963074}],"concepts":[{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.7921693921089172},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6997487545013428},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6990199089050293},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5783600211143494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5717147588729858},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.5607208609580994},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.4458923935890198},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.43233931064605713},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3881685733795166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3619409501552582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.345969021320343},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3326342701911926},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2971264719963074}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0022-0000(03)00005-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(03)00005-9","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"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":"Journal of Computer and System Sciences","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/7fd530fc-7f37-4540-9352-a61ea17d3d5a","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/7fd530fc-7f37-4540-9352-a61ea17d3d5a","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Reynolds , M 2003 , ' The complexity of the temporal logic with \"until\" over general linear time ' , Journal of Computer and System Sciences , vol. 66 , no. 2 , pp. 393-426 . https://doi.org/10.1016/S0022-0000(03)00005-9","raw_type":"article"},{"id":"pmh:oai:researchrepository.murdoch.edu.au:18481","is_oa":false,"landing_page_url":"http://researchrepository.murdoch.edu.au/id/eprint/18481/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400274","display_name":"Murdoch Research Repository (Murdoch University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I176790772","host_organization_name":"Murdoch University","host_organization_lineage":["https://openalex.org/I176790772"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"  Reynolds, M. <http://researchrepository.murdoch.edu.au/view/author/Reynolds, Mark.html>   (2003) The complexity of the temporal logic with \u201cuntil\u201d over general linear time.   Journal of Computer and System Sciences, 66  (2).   pp. 393-426.  ","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W134510267","https://openalex.org/W421997344","https://openalex.org/W605421089","https://openalex.org/W1213181494","https://openalex.org/W1508780728","https://openalex.org/W1525691290","https://openalex.org/W1545104624","https://openalex.org/W1568594638","https://openalex.org/W1580868918","https://openalex.org/W1590867423","https://openalex.org/W1612453857","https://openalex.org/W1969964623","https://openalex.org/W1980256915","https://openalex.org/W1981561399","https://openalex.org/W1982129592","https://openalex.org/W1990865424","https://openalex.org/W2002089154","https://openalex.org/W2003227046","https://openalex.org/W2003773532","https://openalex.org/W2004532354","https://openalex.org/W2008960163","https://openalex.org/W2023808162","https://openalex.org/W2025713304","https://openalex.org/W2031528374","https://openalex.org/W2040022302","https://openalex.org/W2066949643","https://openalex.org/W2075664249","https://openalex.org/W2088312079","https://openalex.org/W2088994048","https://openalex.org/W2094912129","https://openalex.org/W2098171268","https://openalex.org/W2132750992","https://openalex.org/W2157319504","https://openalex.org/W2162583406","https://openalex.org/W2319388297","https://openalex.org/W2408316610","https://openalex.org/W2794950552","https://openalex.org/W4213219346","https://openalex.org/W4248365883","https://openalex.org/W4285719527","https://openalex.org/W4302339081","https://openalex.org/W6609050700","https://openalex.org/W6627921606","https://openalex.org/W6631699901","https://openalex.org/W6632486557","https://openalex.org/W6635363942","https://openalex.org/W6641740895"],"related_works":["https://openalex.org/W31328628","https://openalex.org/W2352091395","https://openalex.org/W1981889059","https://openalex.org/W858755136","https://openalex.org/W3005864166","https://openalex.org/W1526924704","https://openalex.org/W946220898","https://openalex.org/W2560587823","https://openalex.org/W1593278247","https://openalex.org/W2931443989"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}