{"id":"https://openalex.org/W1992762998","doi":"https://doi.org/10.1007/s00236-003-0136-5","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":2004,"publication_date":"2004-04-23","ids":{"openalex":"https://openalex.org/W1992762998","doi":"https://doi.org/10.1007/s00236-003-0136-5","mag":"1992762998"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-003-0136-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-003-0136-5","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01194621","any_repository_has_fulltext":true},"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/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Nicolas Markey","raw_affiliation_strings":["D\u00e9partement d\u2019Informatique, Universit\u00e9 Libre de Bruxelles, Boulevard du Triomphe CP 212, 1050, Bruxelles, Belgium","D\u00e9partement d'Informatique, Universit\u00e9 Libre de Bruxelles, Bruxelles, Belgium 1050"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement d\u2019Informatique, Universit\u00e9 Libre de Bruxelles, Boulevard du Triomphe CP 212, 1050, Bruxelles, Belgium","institution_ids":["https://openalex.org/I132053463"]},{"raw_affiliation_string":"D\u00e9partement d'Informatique, Universit\u00e9 Libre de Bruxelles, Bruxelles, Belgium 1050","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084605938"],"corresponding_institution_ids":["https://openalex.org/I132053463"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":3.1114,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.9096444,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"40","issue":"6-7","first_page":"431","last_page":"458"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9966999888420105,"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/T11567","display_name":"semigroups and automata theory","score":0.9905999898910522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.7113733291625977},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6531800627708435},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.629423201084137},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.616212785243988},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6002501249313354},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.5724116563796997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4932078719139099},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4744254946708679},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43152734637260437},{"id":"https://openalex.org/keywords/modalities","display_name":"Modalities","score":0.42820677161216736},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3996942639350891},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3495067358016968},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21602320671081543}],"concepts":[{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.7113733291625977},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6531800627708435},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.629423201084137},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.616212785243988},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6002501249313354},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5724116563796997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4932078719139099},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4744254946708679},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43152734637260437},{"id":"https://openalex.org/C2779903281","wikidata":"https://www.wikidata.org/wiki/Q6888026","display_name":"Modalities","level":2,"score":0.42820677161216736},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3996942639350891},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3495067358016968},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21602320671081543},{"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},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00236-003-0136-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-003-0136-5","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.106.1046","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.1046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/NM-express2002.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.1356","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.1356","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/Publis/PAPERS/NM-express2002.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.9220","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.9220","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/Publis/PAPERS/Mar-ACTA2004.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.8455","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.8455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Mar-ACTA2004.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01194621v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01194621","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Acta Informatica, 2004, 40 (6-7), pp.431-458. ⟨10.1007/s00236-003-0136-5⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01194621v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01194621","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Acta Informatica, 2004, 40 (6-7), pp.431-458. ⟨10.1007/s00236-003-0136-5⟩","raw_type":"Journal articles"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.6000000238418579,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W105220891","https://openalex.org/W120333500","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/W1602151432","https://openalex.org/W1602995535","https://openalex.org/W1612453857","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/W2030263557","https://openalex.org/W2065353132","https://openalex.org/W2093916942","https://openalex.org/W2098171268","https://openalex.org/W2103146530","https://openalex.org/W2117189826","https://openalex.org/W2131159347","https://openalex.org/W2139891885","https://openalex.org/W2142853014","https://openalex.org/W2157319504","https://openalex.org/W2492759008","https://openalex.org/W2612211757","https://openalex.org/W2913459036","https://openalex.org/W4297937228","https://openalex.org/W4387892784","https://openalex.org/W4388289494"],"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":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}