{"id":"https://openalex.org/W2026209850","doi":"https://doi.org/10.1016/s1571-0661(05)80366-4","title":"Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past","display_name":"Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past","publication_year":2002,"publication_date":"2002-09-01","ids":{"openalex":"https://openalex.org/W2026209850","doi":"https://doi.org/10.1016/s1571-0661(05)80366-4","mag":"2026209850"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80366-4","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80366-4","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80366-4","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084605938","display_name":"Nicolas Markey","orcid":"https://orcid.org/0000-0003-1977-7525"},"institutions":[{"id":"https://openalex.org/I12449238","display_name":"Universit\u00e9 d'Orl\u00e9ans","ror":"https://ror.org/014zrew76","country_code":"FR","type":"education","lineage":["https://openalex.org/I12449238"]},{"id":"https://openalex.org/I4387153997","display_name":"Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans","ror":"https://ror.org/01nr3td38","country_code":null,"type":"facility","lineage":["https://openalex.org/I12449238","https://openalex.org/I4210143826","https://openalex.org/I4387153997"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nicolas Markey","raw_affiliation_strings":["Laboratoire d'lnformatique Fondamentale d'Orl\u00e9ans Universit\u00e9 Orl\u00e9ans & CNRS FRE 2490 6, rue L\u00e9onard de Vinci - BP 6759 45067 ORLEANS C\u00e9dex 2 - FRANCE"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'lnformatique Fondamentale d'Orl\u00e9ans Universit\u00e9 Orl\u00e9ans & CNRS FRE 2490 6, rue L\u00e9onard de Vinci - BP 6759 45067 ORLEANS C\u00e9dex 2 - FRANCE","institution_ids":["https://openalex.org/I12449238","https://openalex.org/I4387153997"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084605938"],"corresponding_institution_ids":["https://openalex.org/I12449238","https://openalex.org/I4387153997"],"apc_list":null,"apc_paid":null,"fwci":1.0163,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74347655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"68","issue":"2","first_page":"87","last_page":"104"},"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.9980999827384949,"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.9962999820709229,"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.7947482466697693},{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.6855659484863281},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6328839063644409},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6054337024688721},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6005356907844543},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.5526109337806702},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.469896525144577},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46620118618011475},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43838411569595337},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3952123522758484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3661998510360718},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24100741744041443}],"concepts":[{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.7947482466697693},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.6855659484863281},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6328839063644409},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6054337024688721},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6005356907844543},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5526109337806702},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.469896525144577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46620118618011475},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43838411569595337},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3952123522758484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3661998510360718},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24100741744041443},{"id":"https://openalex.org/C191897082","wikidata":"https://www.wikidata.org/wiki/Q11467","display_name":"Metallurgy","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(05)80366-4","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80366-4","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80366-4","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80366-4","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.6299999952316284,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W105220891","https://openalex.org/W1258654203","https://openalex.org/W1491593738","https://openalex.org/W1501571921","https://openalex.org/W1506588809","https://openalex.org/W1526271624","https://openalex.org/W1540180001","https://openalex.org/W1545354279","https://openalex.org/W1546022948","https://openalex.org/W1549122259","https://openalex.org/W1568275823","https://openalex.org/W1590315663","https://openalex.org/W1602995535","https://openalex.org/W1612453857","https://openalex.org/W1884902993","https://openalex.org/W1986184086","https://openalex.org/W1990609140","https://openalex.org/W1998387957","https://openalex.org/W2003227046","https://openalex.org/W2023808162","https://openalex.org/W2026379532","https://openalex.org/W2026629052","https://openalex.org/W2065353132","https://openalex.org/W2093916942","https://openalex.org/W2098171268","https://openalex.org/W2103146530","https://openalex.org/W2116509046","https://openalex.org/W2117189826","https://openalex.org/W2132750992","https://openalex.org/W2139891885","https://openalex.org/W2140028191","https://openalex.org/W2142853014","https://openalex.org/W2157319504","https://openalex.org/W2396555304","https://openalex.org/W2492759008","https://openalex.org/W2612211757","https://openalex.org/W2913459036","https://openalex.org/W4213322697","https://openalex.org/W4256581173","https://openalex.org/W6628302856","https://openalex.org/W6629535518","https://openalex.org/W6632576102","https://openalex.org/W6634064149","https://openalex.org/W6635725723","https://openalex.org/W6636501790","https://openalex.org/W6646708787","https://openalex.org/W6648029779","https://openalex.org/W6649922270","https://openalex.org/W6651355794","https://openalex.org/W6656255003","https://openalex.org/W6657010877","https://openalex.org/W6666503191","https://openalex.org/W6675465768","https://openalex.org/W6679480335","https://openalex.org/W6680484969","https://openalex.org/W6682991435"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W3021103820","https://openalex.org/W2763487042","https://openalex.org/W2031188261","https://openalex.org/W4232446061","https://openalex.org/W4285022830","https://openalex.org/W2020883449","https://openalex.org/W3035590440","https://openalex.org/W4312622265","https://openalex.org/W1507805823"],"abstract_inverted_index":{"We":[0,75],"study":[1],"the":[2,9,26,32,37],"complexity":[3,86],"of":[4,8,22,29,34,39],"satisfiability":[5],"and":[6,66,80],"model-checking":[7,82],"linear-time":[10],"temporal":[11,30],"logic":[12],"with":[13],"past":[14,43,73],"(PLTL).":[15],"More":[16],"precisely,":[17],"we":[18],"consider":[19],"several":[20],"fragments":[21],"PLTL.":[23],"depending":[24],"on":[25],"allowed":[27],"set":[28],"modalities,":[31],"use":[33],"negations":[35],"or":[36],"nesting":[38,69],"future":[40,70],"formulae":[41,71],"into":[42,72],"formulae.":[44,74],"Our":[45],"results":[46],"show":[47],"that":[48,53,78],"\u201cpast":[49],"is":[50,54],"for":[51,63,87],"free\u201d,":[52],"it":[55],"does":[56],"not":[57],"bring":[58],"additional":[59],"theoretical":[60],"complexity,":[61],"even":[62,67],"small":[64],"fragments,":[65],"when":[68],"also":[76],"remark":[77],"existential":[79],"universal":[81],"can":[83],"have":[84],"different":[85],"certain":[88],"fragments.":[89]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}