{"id":"https://openalex.org/W2110758029","doi":"https://doi.org/10.1109/time.2004.1314434","title":"Decidability of the theory of the totally unbounded /spl omega/-layered structure","display_name":"Decidability of the theory of the totally unbounded /spl omega/-layered structure","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2110758029","doi":"https://doi.org/10.1109/time.2004.1314434","mag":"2110758029"},"language":"en","primary_location":{"id":"doi:10.1109/time.2004.1314434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2004.1314434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.","raw_type":"proceedings-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/A5015702335","display_name":"Angelo Montanari","orcid":"https://orcid.org/0000-0002-4322-769X"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"A. Montanari","raw_affiliation_strings":["Dipartimento di Matematica e Informatica, Universit\u00e1 di Udine, Udine, Italy","Dipt. di Matematica e Informatica, Universita di Udine, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Informatica, Universit\u00e1 di Udine, Udine, Italy","institution_ids":["https://openalex.org/I129043915"]},{"raw_affiliation_string":"Dipt. di Matematica e Informatica, Universita di Udine, Italy","institution_ids":["https://openalex.org/I129043915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105824253","display_name":"Gabriele Puppis","orcid":"https://orcid.org/0000-0001-9831-3264"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Puppis","raw_affiliation_strings":["Dipartimento di Matematica e Informatica, Universit\u00e1 di Udine, Udine, Italy","Dipt. di Matematica e Informatica, Universita di Udine, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Informatica, Universit\u00e1 di Udine, Udine, Italy","institution_ids":["https://openalex.org/I129043915"]},{"raw_affiliation_string":"Dipt. di Matematica e Informatica, Universita di Udine, Italy","institution_ids":["https://openalex.org/I129043915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015702335"],"corresponding_institution_ids":["https://openalex.org/I129043915"],"apc_list":null,"apc_paid":null,"fwci":1.3486,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81192166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2420","issue":null,"first_page":"156","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9979000091552734,"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/T11567","display_name":"semigroups and automata theory","score":0.9979000091552734,"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/T10142","display_name":"Formal Methods in Verification","score":0.9958000183105469,"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.991100013256073,"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/decidability","display_name":"Decidability","score":0.8379653692245483},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.7064491510391235},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6446149349212646},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5433294773101807},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5420218110084534},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5331330299377441},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5155441761016846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47899577021598816},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46064430475234985},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.45919808745384216},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.41150298714637756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39799806475639343},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33281803131103516},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3155324459075928},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.2578866481781006},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.25325992703437805},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2208867073059082},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12133029103279114}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8379653692245483},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.7064491510391235},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6446149349212646},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5433294773101807},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5420218110084534},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5331330299377441},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5155441761016846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47899577021598816},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46064430475234985},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.45919808745384216},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.41150298714637756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39799806475639343},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33281803131103516},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3155324459075928},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.2578866481781006},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25325992703437805},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2208867073059082},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12133029103279114},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/time.2004.1314434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2004.1314434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.75,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1585989904","https://openalex.org/W1816620374","https://openalex.org/W1914273579","https://openalex.org/W2008735821","https://openalex.org/W2032489844","https://openalex.org/W2041135966","https://openalex.org/W2068398685","https://openalex.org/W2162583406","https://openalex.org/W4240244556","https://openalex.org/W6635254242"],"related_works":["https://openalex.org/W2506746226","https://openalex.org/W2109489765","https://openalex.org/W3104737963","https://openalex.org/W1886746238","https://openalex.org/W2182252111","https://openalex.org/W1582302366","https://openalex.org/W2153551293","https://openalex.org/W2980590076","https://openalex.org/W4300013286","https://openalex.org/W2021535402"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,52,76],"address":[4],"the":[5,46,54,58,86,90],"decision":[6],"problem":[7,47,56,59,88],"for":[8,62],"a":[9,25,29,35,71,78],"system":[10],"of":[11,23,60,81,93],"monadic":[12],"second-order":[13],"logic":[14],"interpreted":[15],"over":[16],"an":[17,41],"/spl":[18],"omega/-layered":[19],"temporal":[20],"structure":[21,36],"devoid":[22],"both":[24],"finest":[26],"layer":[27],"and":[28],"coarsest":[30],"one":[31],"(we":[32],"call":[33],"such":[34],"totally":[37],"unbounded).":[38],"We":[39],"propose":[40],"automaton-theoretic":[42],"method":[43],"that":[44],"solves":[45],"in":[48],"two":[49],"steps:":[50],"first,":[51],"reduce":[53,85],"considered":[55],"to":[57,84,89],"determining,":[61],"any":[63],"given":[64],"Rabin":[65],"tree":[66,82],"automaton,":[67],"whether":[68],"it":[69],"accepts":[70],"fixed":[72],"vertex-colored":[73],"tree;":[74],"then,":[75],"exploit":[77],"suitable":[79],"notion":[80],"equivalence":[83],"latter":[87],"decidable":[91],"case":[92],"regular":[94],"trees.":[95]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}