{"id":"https://openalex.org/W2058579816","doi":"https://doi.org/10.2168/lmcs-8(4:10)2012","title":"Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds","display_name":"Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds","publication_year":2012,"publication_date":"2012-10-23","ids":{"openalex":"https://openalex.org/W2058579816","doi":"https://doi.org/10.2168/lmcs-8(4:10)2012","mag":"2058579816"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(4:10)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(4:10)2012","pdf_url":"https://lmcs.episciences.org/1219/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1219/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058480266","display_name":"Lars Kuhtz","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lars Kuhtz","raw_affiliation_strings":["UniVersit\u00e4t des Saarlandes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UniVersit\u00e4t des Saarlandes","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048189898","display_name":"Bernd Finkbeiner","orcid":"https://orcid.org/0000-0002-4280-8441"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bernd Finkbeiner","raw_affiliation_strings":["UniVersit\u00e4t des Saarlandes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UniVersit\u00e4t des Saarlandes","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":2.2683,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88398637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"Volume 8, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9882000088691711,"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.9848999977111816,"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.8471689820289612},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7586727142333984},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.7558188438415527},{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.6895477771759033},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6755171418190002},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.6337786912918091},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5958141088485718},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.5590965747833252},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47218599915504456},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46721047163009644},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4605483412742615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44046008586883545},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3171742558479309},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18325436115264893}],"concepts":[{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.8471689820289612},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7586727142333984},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.7558188438415527},{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.6895477771759033},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6755171418190002},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.6337786912918091},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5958141088485718},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.5590965747833252},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47218599915504456},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46721047163009644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4605483412742615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44046008586883545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3171742558479309},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18325436115264893},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-8(4:10)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(4:10)2012","pdf_url":"https://lmcs.episciences.org/1219/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1210.0574","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1210.0574","pdf_url":"https://arxiv.org/pdf/1210.0574","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.762.9818","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.762.9818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1210.0574.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:84b327d28a7742f18679e23ddc582376","is_oa":true,"landing_page_url":"https://doaj.org/article/84b327d28a7742f18679e23ddc582376","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 4 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(4:10)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(4:10)2012","pdf_url":"https://lmcs.episciences.org/1219/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1230235592","display_name":null,"funder_award_id":"SFB/TR 14 AVACS","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5949215475","display_name":null,"funder_award_id":"SFB/TR 14","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2058579816.pdf","grobid_xml":"https://content.openalex.org/works/W2058579816.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W105220891","https://openalex.org/W154638891","https://openalex.org/W1479975624","https://openalex.org/W1489725951","https://openalex.org/W1490189322","https://openalex.org/W1491593738","https://openalex.org/W1503004197","https://openalex.org/W1506378440","https://openalex.org/W1524646280","https://openalex.org/W1538818040","https://openalex.org/W1559902149","https://openalex.org/W1563199150","https://openalex.org/W1584086289","https://openalex.org/W1827805140","https://openalex.org/W1955197180","https://openalex.org/W1965874601","https://openalex.org/W1998855954","https://openalex.org/W2009121158","https://openalex.org/W2026379532","https://openalex.org/W2028637393","https://openalex.org/W2031848583","https://openalex.org/W2101931376","https://openalex.org/W2103146530","https://openalex.org/W2105167627","https://openalex.org/W2118962824","https://openalex.org/W2126606154","https://openalex.org/W2127585076","https://openalex.org/W2154932413","https://openalex.org/W2181189727","https://openalex.org/W2400283444","https://openalex.org/W4210321366","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W1513400763","https://openalex.org/W1583068981","https://openalex.org/W2521108391","https://openalex.org/W2019529782","https://openalex.org/W2359102888","https://openalex.org/W2110468917","https://openalex.org/W2563378524","https://openalex.org/W2058579816","https://openalex.org/W1516431369"],"abstract_inverted_index":{"Path":[0],"checking,":[1],"the":[2,6,11,45,50,66,69],"special":[3],"case":[4],"of":[5,52,68],"model":[7,12],"checking":[8,37,73],"problem":[9],"where":[10],"under":[13],"consideration":[14],"is":[15,84],"a":[16],"single":[17],"path,":[18],"plays":[19],"an":[20],"important":[21],"role":[22],"in":[23,85],"monitoring,":[24],"testing,":[25],"and":[26,57,82],"verification.":[27],"We":[28],"prove":[29],"that":[30],"for":[31,79],"linear-time":[32],"temporal":[33],"logic":[34,70],"(LTL),":[35],"path":[36,72],"can":[38],"be":[39],"efficiently":[40,75],"parallelized.":[41],"In":[42],"addition":[43],"to":[44],"core":[46],"logic,":[47],"we":[48],"consider":[49],"extensions":[51,64],"LTL":[53],"with":[54],"bounded-future":[55],"(BLTL)":[56],"past-time":[58],"(LTL+Past)":[59],"operators.":[60],"Even":[61],"though":[62],"both":[63],"improve":[65],"succinctness":[67],"exponentially,":[71],"remains":[74],"parallelizable:":[76],"Our":[77],"algorithm":[78],"LTL,":[80],"LTL+Past,":[81],"BLTL+Past":[83],"AC^1(logDCFL)":[86],"\\subseteq":[87],"NC.":[88]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}