{"id":"https://openalex.org/W1552488915","doi":"https://doi.org/10.1007/bfb0084793","title":"The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic","display_name":"The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic","publication_year":2006,"publication_date":"2006-11-24","ids":{"openalex":"https://openalex.org/W1552488915","doi":"https://doi.org/10.1007/bfb0084793","mag":"1552488915"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0084793","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0084793","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5044916617","display_name":"Roope Kaivola","orcid":null},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Roope Kaivola","raw_affiliation_strings":["Department of Computer Science, University of Helsinki, Helsinki, Finland","#N##TAB##TAB##TAB##TAB# University of Helsinki#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Helsinki, Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Helsinki#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062460264","display_name":"Antti Valmari","orcid":"https://orcid.org/0000-0002-5022-1624"},"institutions":[{"id":"https://openalex.org/I87653560","display_name":"VTT Technical Research Centre of Finland","ror":"https://ror.org/04b181w54","country_code":"FI","type":"nonprofit","lineage":["https://openalex.org/I4210089493","https://openalex.org/I87653560"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Antti Valmari","raw_affiliation_strings":["Computer Technology Laboratory, Technical Research Centre of Finland, Oulu, Finland","Technical Research Centre of Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Technology Laboratory, Technical Research Centre of Finland, Oulu, Finland","institution_ids":["https://openalex.org/I87653560"]},{"raw_affiliation_string":"Technical Research Centre of Finland","institution_ids":["https://openalex.org/I87653560"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3551,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.87182845,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"221"},"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.9945999979972839,"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/T11424","display_name":"Security and Verification in Computing","score":0.993399977684021,"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.6788997650146484},{"id":"https://openalex.org/keywords/congruence-relation","display_name":"Congruence relation","score":0.6665872931480408},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.665765643119812},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.633813202381134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4944112300872803},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.4791092872619629},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.44527652859687805},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.44057151675224304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41623738408088684},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3921585977077484},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3797438144683838},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2876923680305481}],"concepts":[{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6788997650146484},{"id":"https://openalex.org/C9973445","wikidata":"https://www.wikidata.org/wiki/Q8349849","display_name":"Congruence relation","level":2,"score":0.6665872931480408},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.665765643119812},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.633813202381134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4944112300872803},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.4791092872619629},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.44527652859687805},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.44057151675224304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41623738408088684},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3921585977077484},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3797438144683838},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2876923680305481}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bfb0084793","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0084793","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1492683468","https://openalex.org/W1500812389","https://openalex.org/W1503973138","https://openalex.org/W1507198985","https://openalex.org/W1532447905","https://openalex.org/W1573453798","https://openalex.org/W1589276513","https://openalex.org/W2002128397","https://openalex.org/W2090398333","https://openalex.org/W2121372686","https://openalex.org/W2137467159","https://openalex.org/W2144545266","https://openalex.org/W2571737579"],"related_works":["https://openalex.org/W31328628","https://openalex.org/W2488288761","https://openalex.org/W1532447905","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"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}