{"id":"https://openalex.org/W2040022302","doi":"https://doi.org/10.1305/ndjfl/1039700748","title":"A Decidable Temporal Logic of Parallelism","display_name":"A Decidable Temporal Logic of Parallelism","publication_year":1997,"publication_date":"1997-07-01","ids":{"openalex":"https://openalex.org/W2040022302","doi":"https://doi.org/10.1305/ndjfl/1039700748","mag":"2040022302"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1039700748","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1039700748","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-38/issue-3/A-Decidable-Temporal-Logic-of-Parallelism/10.1305/ndjfl/1039700748.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-38/issue-3/A-Decidable-Temporal-Logic-of-Parallelism/10.1305/ndjfl/1039700748.pdf","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mark Reynolds","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036930915"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8113,"has_fulltext":true,"cited_by_count":43,"citation_normalized_percentile":{"value":0.87122086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"38","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987999796867371,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"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/decidability","display_name":"Decidability","score":0.9083503484725952},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6624280214309692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.624610424041748},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6236175298690796},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.49843382835388184},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4818459749221802},{"id":"https://openalex.org/keywords/temporal-logic-of-actions","display_name":"Temporal logic of actions","score":0.46590739488601685},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3842659294605255},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.3420200049877167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33421629667282104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3281519412994385},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3277101516723633},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.09852990508079529},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.05377364158630371}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9083503484725952},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6624280214309692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.624610424041748},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6236175298690796},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.49843382835388184},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4818459749221802},{"id":"https://openalex.org/C11648818","wikidata":"https://www.wikidata.org/wiki/Q2403081","display_name":"Temporal logic of actions","level":4,"score":0.46590739488601685},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3842659294605255},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.3420200049877167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33421629667282104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3281519412994385},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3277101516723633},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09852990508079529},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.05377364158630371},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1305/ndjfl/1039700748","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1039700748","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-38/issue-3/A-Decidable-Temporal-Logic-of-Parallelism/10.1305/ndjfl/1039700748.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/e284004b-2cc5-4d19-876a-8f1d2b975456","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/e284004b-2cc5-4d19-876a-8f1d2b975456","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 1997, 'A decidable temporal logic of parallelism', Notre Dame Journal of Formal Logic, pp. 419-436.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1039700748","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1039700748","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.2290","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.2290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr98-01.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1305/ndjfl/1039700748","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1039700748","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-38/issue-3/A-Decidable-Temporal-Logic-of-Parallelism/10.1305/ndjfl/1039700748.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.47999998927116394}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2040022302.pdf","grobid_xml":"https://content.openalex.org/works/W2040022302.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W178976057","https://openalex.org/W1543662166","https://openalex.org/W1651570284","https://openalex.org/W1966911791","https://openalex.org/W1968658145","https://openalex.org/W1979405912","https://openalex.org/W1982615521","https://openalex.org/W2002262052","https://openalex.org/W2004860506","https://openalex.org/W2014960597","https://openalex.org/W2015032331","https://openalex.org/W2017661088","https://openalex.org/W2019539243","https://openalex.org/W2028942690","https://openalex.org/W2040022302","https://openalex.org/W2066949643","https://openalex.org/W2072538249","https://openalex.org/W2086974576","https://openalex.org/W2146819619","https://openalex.org/W2806189505","https://openalex.org/W3140030144","https://openalex.org/W4234687429","https://openalex.org/W4235944370","https://openalex.org/W4236084372","https://openalex.org/W4255686678","https://openalex.org/W4285719527","https://openalex.org/W4388294888","https://openalex.org/W6607245020","https://openalex.org/W6632486557","https://openalex.org/W6644804265","https://openalex.org/W6750077501","https://openalex.org/W6752548622"],"related_works":["https://openalex.org/W4387188591","https://openalex.org/W946220898","https://openalex.org/W2143050727","https://openalex.org/W4232446061","https://openalex.org/W2124110813","https://openalex.org/W2092656858","https://openalex.org/W4285022830","https://openalex.org/W2561906579","https://openalex.org/W1981384792","https://openalex.org/W2234817167"],"abstract_inverted_index":{"In":[0],"this":[1,40],"paper":[2],"we":[3],"shall":[4],"introduce":[5],"a":[6,30,63],"simple":[7],"temporal":[8,15],"logic":[9,47],"suitable":[10],"for":[11],"reasoning":[12],"about":[13],"the":[14,33,46,51,58],"aspects":[16],"of":[17,32,39,66],"parallel":[18,20],"universes,":[19],"processes,":[21],"distributed":[22],"systems,":[23],"or":[24],"multiple":[25],"agents.":[26],"We":[27,42],"will":[28],"use":[29],"variant":[31],"mosaic":[34,59],"method":[35,60],"to":[36],"prove":[37],"decidability":[38],"logic.":[41],"also":[43],"show":[44],"that":[45,57],"does":[48],"not":[49],"have":[50],"finite":[52],"model":[53],"property.":[54],"This":[55],"shows":[56],"is":[61],"sometimes":[62],"stronger":[64],"way":[65],"establishing":[67],"decidability.":[68]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}