{"id":"https://openalex.org/W2090917162","doi":"https://doi.org/10.1016/s0304-3975(97)00219-3","title":"An algorithmic approach for checking closure properties of temporal logic specifications and \u03c9-regular languages","display_name":"An algorithmic approach for checking closure properties of temporal logic specifications and \u03c9-regular languages","publication_year":1998,"publication_date":"1998-03-01","ids":{"openalex":"https://openalex.org/W2090917162","doi":"https://doi.org/10.1016/s0304-3975(97)00219-3","mag":"2090917162"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(97)00219-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00219-3","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","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/A5061223044","display_name":"Doron Peled","orcid":"https://orcid.org/0000-0002-7280-6578"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Doron Peled","raw_affiliation_strings":["Bell Laboratories, Lucent Technologies, 700 Mountain Avenue, Murray Hill, NJ 07974-0636, USA","Bell Laboratories Murray Hill NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lucent Technologies, 700 Mountain Avenue, Murray Hill, NJ 07974-0636, USA","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories Murray Hill NJ","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084744032","display_name":"Thomas Wilke","orcid":"https://orcid.org/0000-0001-8263-7758"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Wilke","raw_affiliation_strings":["Christian-Albrechts-Universit\u00e4t zu Kiel, Institut f\u00fcr Informatik und Praktische Mathematik, Olshausenstrasse 40, D-24098 Kiel, Germany","Christian-Albrechts University Zu Kiel, Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Christian-Albrechts-Universit\u00e4t zu Kiel, Institut f\u00fcr Informatik und Praktische Mathematik, Olshausenstrasse 40, D-24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Christian-Albrechts University Zu Kiel, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074692660","display_name":"Pierre Wolper","orcid":"https://orcid.org/0000-0002-6729-8142"},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Pierre Wolper","raw_affiliation_strings":["Universit\u00e9 de Li\u00e8ge, Institut Montefiore, B28, 4000 Li\u00e8ge, Belgium","Univ. de Li\u00e8ge, Li\u00e8ge, Belgium#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Li\u00e8ge, Institut Montefiore, B28, 4000 Li\u00e8ge, Belgium","institution_ids":["https://openalex.org/I157674565"]},{"raw_affiliation_string":"Univ. de Li\u00e8ge, Li\u00e8ge, Belgium#TAB#","institution_ids":["https://openalex.org/I157674565"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074692660"],"corresponding_institution_ids":["https://openalex.org/I157674565"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":1.9485,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.86637546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"195","issue":"2","first_page":"183","last_page":"203"},"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.9991000294685364,"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.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6904296875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5757759809494019},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5659030675888062},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.546721339225769},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5410756468772888},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5250009298324585},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5079160332679749},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5017070770263672},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4717857539653778},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4638996124267578},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4561362564563751},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.44383981823921204},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.43568533658981323},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42734724283218384},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.4118242561817169},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39510318636894226},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39492130279541016},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31938856840133667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3015405833721161},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2127610743045807},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.164331316947937}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6904296875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5757759809494019},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5659030675888062},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.546721339225769},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5410756468772888},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5250009298324585},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5079160332679749},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5017070770263672},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4717857539653778},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4638996124267578},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4561362564563751},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.44383981823921204},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.43568533658981323},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42734724283218384},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.4118242561817169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39510318636894226},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39492130279541016},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31938856840133667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3015405833721161},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2127610743045807},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.164331316947937},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(97)00219-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00219-3","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:orbi.ulg.ac.be:2268/27542","is_oa":false,"landing_page_url":"https://orbi.uliege.be/handle/2268/27542","pdf_url":null,"source":{"id":"https://openalex.org/S4306400651","display_name":"Open Repository and Bibliography (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 195 (2), 183-203 (1998)","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W44066247","https://openalex.org/W1528441743","https://openalex.org/W1540501475","https://openalex.org/W1560050980","https://openalex.org/W1601573757","https://openalex.org/W1608032220","https://openalex.org/W1767070588","https://openalex.org/W1895483727","https://openalex.org/W1934074768","https://openalex.org/W1965309410","https://openalex.org/W1976773489","https://openalex.org/W1986895439","https://openalex.org/W1990161286","https://openalex.org/W1990609140","https://openalex.org/W2003227046","https://openalex.org/W2022136117","https://openalex.org/W2023808162","https://openalex.org/W2033071128","https://openalex.org/W2034410903","https://openalex.org/W2039529128","https://openalex.org/W2054739713","https://openalex.org/W2081163032","https://openalex.org/W2128578503","https://openalex.org/W2132750992","https://openalex.org/W2137307988","https://openalex.org/W2165106244","https://openalex.org/W2395891450","https://openalex.org/W2571737579","https://openalex.org/W2806619258","https://openalex.org/W2912084748","https://openalex.org/W6631748437","https://openalex.org/W6632470882","https://openalex.org/W6633342049","https://openalex.org/W6636397974","https://openalex.org/W6637933941","https://openalex.org/W6639853945","https://openalex.org/W6656255003","https://openalex.org/W6660559572","https://openalex.org/W6678822513","https://openalex.org/W6680172404","https://openalex.org/W6681220533","https://openalex.org/W6732077479","https://openalex.org/W6758810558"],"related_works":["https://openalex.org/W2273393794","https://openalex.org/W2395025735","https://openalex.org/W2154625854","https://openalex.org/W1543261728","https://openalex.org/W2144159228","https://openalex.org/W2171225173","https://openalex.org/W2031528374","https://openalex.org/W121296599","https://openalex.org/W3037437009","https://openalex.org/W4390961934"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}