{"id":"https://openalex.org/W2603686671","doi":"https://doi.org/10.2168/lmcs-4(3:11)2008","title":"The Complexity of Enriched Mu-Calculi","display_name":"The Complexity of Enriched Mu-Calculi","publication_year":2008,"publication_date":"2008-09-22","ids":{"openalex":"https://openalex.org/W2603686671","doi":"https://doi.org/10.2168/lmcs-4(3:11)2008","mag":"2603686671"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-4(3:11)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(3:11)2008","pdf_url":"http://lmcs.episciences.org/993/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://lmcs.episciences.org/993/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Piero A. Bonatti","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108560","display_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Napoli","ror":"https://ror.org/015kcdd40","country_code":"IT","type":"facility","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210108560"]},{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Piero A. Bonatti","raw_affiliation_strings":["Universit di Napoli \"Federico II\", Dipartimento di Scienze Fisiche, 80126 Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"Universit di Napoli \"Federico II\", Dipartimento di Scienze Fisiche, 80126 Napoli, Italy","institution_ids":["https://openalex.org/I4210108560","https://openalex.org/I71267560"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Carsten Lutz","orcid":"https://orcid.org/0000-0002-8791-6702"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Carsten Lutz","raw_affiliation_strings":["TU Dresden, Institute for Theoretical Computer Science, 01062 Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dresden, Institute for Theoretical Computer Science, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Aniello Murano","orcid":"https://orcid.org/0000-0003-4876-3448"},"institutions":[{"id":"https://openalex.org/I4210108560","display_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Napoli","ror":"https://ror.org/015kcdd40","country_code":"IT","type":"facility","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210108560"]},{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Aniello Murano","raw_affiliation_strings":["Universit di Napoli \"Federico II\", Dipartimento di Scienze Fisiche, 80126 Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"Universit di Napoli \"Federico II\", Dipartimento di Scienze Fisiche, 80126 Napoli, Italy","institution_ids":["https://openalex.org/I4210108560","https://openalex.org/I71267560"]}]},{"author_position":"last","author":{"id":null,"display_name":"Moshe Y. Vardi","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210108560","display_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Napoli","ror":"https://ror.org/015kcdd40","country_code":"IT","type":"facility","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210108560"]},{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]},{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["IT","US"],"is_corresponding":false,"raw_author_name":"Moshe Y. Vardi","raw_affiliation_strings":["Microsoft Research and Rice University, Dept. of Computer Science, TX 77251-1892, USA","Universit di Napoli \"Federico II\", Dipartimento di Scienze Fisiche, 80126 Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"Microsoft Research and Rice University, Dept. of Computer Science, TX 77251-1892, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I74775410"]},{"raw_affiliation_string":"Universit di Napoli \"Federico II\", Dipartimento di Scienze Fisiche, 80126 Napoli, Italy","institution_ids":["https://openalex.org/I4210108560","https://openalex.org/I71267560"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210108560","https://openalex.org/I71267560"],"apc_list":null,"apc_paid":null,"fwci":0.8233,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.78264095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"Volume 4, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.5853999853134155,"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.5853999853134155,"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.15690000355243683,"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.1370999962091446,"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.8482999801635742},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6617000102996826},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5713000297546387},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.45969998836517334},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4332999885082245},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.3873000144958496},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.35350000858306885},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.34060001373291016},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.32899999618530273}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8482999801635742},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6617000102996826},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5713000297546387},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5525000095367432},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5254999995231628},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.45969998836517334},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4332999885082245},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.358599990606308},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3538999855518341},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.35350000858306885},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.34060001373291016},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.32899999618530273},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.31679999828338623},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3131999969482422},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30250000953674316},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28600001335144043},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.2743000090122223},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.2743000090122223},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.27149999141693115},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.2689000070095062},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.258899986743927}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-4(3:11)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(3:11)2008","pdf_url":"http://lmcs.episciences.org/993/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0809.0360","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0809.0360","pdf_url":"https://arxiv.org/pdf/0809.0360","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:f6b6cc73cb564a52aa375359579cb308","is_oa":true,"landing_page_url":"https://doaj.org/article/f6b6cc73cb564a52aa375359579cb308","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 4, Issue 3 (2008)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-4(3:11)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(3:11)2008","pdf_url":"http://lmcs.episciences.org/993/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G425312499","display_name":"Automata-Theoretic Approach to Design Verification","funder_award_id":"0311326","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G920019786","display_name":"MRI:  Acquisition of CITI Terascale Cluster (CTC)","funder_award_id":"0216467","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320313284","display_name":"Isaac Newton Institute for Mathematical Sciences","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2603686671.pdf","grobid_xml":"https://content.openalex.org/works/W2603686671.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W135426567","https://openalex.org/W1551503011","https://openalex.org/W1968847402","https://openalex.org/W1988808695","https://openalex.org/W1990609140","https://openalex.org/W1996207810","https://openalex.org/W2041580396","https://openalex.org/W2069709605","https://openalex.org/W2083398633","https://openalex.org/W2092043492","https://openalex.org/W2124876285","https://openalex.org/W2170933628","https://openalex.org/W6634016468","https://openalex.org/W6912992434"],"related_works":[],"abstract_inverted_index":{"The":[0,130,153,167],"fully":[1,26,56,146,178],"enriched":[2,27,57,147,179],"μ-calculus":[3,10,28,58,180],"is":[4,29,45,82],"the":[5,8,25,42,52,55,68,124,165,177,182],"extension":[6],"of":[7,24,54,67,91,159],"propositional":[9],"with":[11],"inverse":[12],"programs,":[13],"graded":[14,137],"modalities,":[15],"and":[16,34,84,119,145],"nominals.":[17],"While":[18],"satisfiability":[19,81,122],"in":[20,74,78,99,123,172],"several":[21],"expressive":[22,100],"fragments":[23,53,76],"known":[30],"to":[31,127],"be":[32],"decidable":[33,83,92],"ExpTime-complete,":[35,118],"it":[36],"has":[37],"recently":[38],"been":[39],"proved":[40],"that":[41,59,94,113],"full":[43],"calculus":[44],"undecidable.":[46],"In":[47],"this":[48,79],"paper,":[49],"we":[50,87,133],"study":[51],"are":[60,95,104,117,135,155],"obtained":[61,77,105],"by":[62,106],"dropping":[63],"at":[64],"least":[65],"one":[66],"additional":[69],"constructs.":[70],"We":[71],"show":[72],"that,":[73],"all":[75],"way,":[80],"ExpTime-complete.":[85],"Thus,":[86],"identify":[88],"a":[89,156,173],"family":[90],"logics":[93,126],"maximal":[96],"(and":[97],"incomparable)":[98],"power.":[101],"Our":[102],"results":[103],"introducing":[107],"two":[108,160],"new":[109],"automata":[110,131,140,148,162,171],"models,":[111],"showing":[112],"their":[114],"emptiness":[115],"problems":[116],"then":[120],"reducing":[121],"relevant":[125],"these":[128],"problems.":[129],"models":[132,163],"introduce":[134],"two-way":[136],"alternating":[138,170],"parity":[139],"over":[141,150],"infinite":[142,151],"trees":[143],"(2GAPTs)":[144],"(FEAs)":[149],"forests.":[152],"former":[154],"common":[157],"generalization":[158],"incomparable":[161],"from":[164],"literature.":[166],"latter":[168],"extend":[169],"similar":[174],"way":[175],"as":[176],"extends":[181],"standard":[183],"μ-calculus.":[184]},"counts_by_year":[{"year":2025,"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":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2017-04-07T00:00:00"}