{"id":"https://openalex.org/W2252821131","doi":"https://doi.org/10.1080/11663081.2015.1050907","title":"Expressiveness and succinctness of a logic of robustness","display_name":"Expressiveness and succinctness of a logic of robustness","publication_year":2015,"publication_date":"2015-07-03","ids":{"openalex":"https://openalex.org/W2252821131","doi":"https://doi.org/10.1080/11663081.2015.1050907","mag":"2252821131"},"language":"en","primary_location":{"id":"doi:10.1080/11663081.2015.1050907","is_oa":false,"landing_page_url":"https://doi.org/10.1080/11663081.2015.1050907","pdf_url":null,"source":{"id":"https://openalex.org/S93822064","display_name":"Journal of Applied Non-Classical Logics","issn_l":"1166-3081","issn":["1166-3081","1958-5780"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Non-Classical Logics","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/A5016050623","display_name":"John C. McCabe-Dansted","orcid":"https://orcid.org/0000-0003-4343-4119"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John C. McCabe-Dansted","raw_affiliation_strings":["School of Computer Science and Software Engineering,, The University of Western Australia, "],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering,, The University of Western Australia, ","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030763134","display_name":"Tim French","orcid":"https://orcid.org/0000-0002-0748-8040"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tim French","raw_affiliation_strings":["School of Computer Science and Software Engineering,, The University of Western Australia, "],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering,, The University of Western Australia, ","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045320227","display_name":"Sophie Pinchinat","orcid":"https://orcid.org/0000-0002-0901-8480"},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sophie Pinchinat","raw_affiliation_strings":["IRISA, Campus Universitaire de Beaulieu, Rennes, France"],"affiliations":[{"raw_affiliation_string":"IRISA, Campus Universitaire de Beaulieu, Rennes, France","institution_ids":["https://openalex.org/I2802519937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036930915","display_name":"Mark Reynolds","orcid":"https://orcid.org/0000-0002-5415-0544"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mark Reynolds","raw_affiliation_strings":["School of Computer Science and Software Engineering,, The University of Western Australia, "],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering,, The University of Western Australia, ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5036930915"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12759045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"25","issue":"3","first_page":"193","last_page":"228"},"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.9991999864578247,"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.9991999864578247,"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/succinctness","display_name":"Succinctness","score":0.9725664854049683},{"id":"https://openalex.org/keywords/ctl*","display_name":"CTL*","score":0.921593427658081},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6623499393463135},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.6264732480049133},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5298357605934143},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.508438766002655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49938058853149414},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4718256890773773},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4558985233306885},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.42505115270614624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4015299081802368},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3449651896953583}],"concepts":[{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.9725664854049683},{"id":"https://openalex.org/C147969180","wikidata":"https://www.wikidata.org/wiki/Q5014579","display_name":"CTL*","level":4,"score":0.921593427658081},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6623499393463135},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.6264732480049133},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5298357605934143},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.508438766002655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49938058853149414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4718256890773773},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4558985233306885},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.42505115270614624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4015299081802368},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3449651896953583},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C154317977","wikidata":"https://www.wikidata.org/wiki/Q376266","display_name":"Cytotoxic T cell","level":3,"score":0.0},{"id":"https://openalex.org/C202751555","wikidata":"https://www.wikidata.org/wiki/Q221681","display_name":"In vitro","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/11663081.2015.1050907","is_oa":false,"landing_page_url":"https://doi.org/10.1080/11663081.2015.1050907","pdf_url":null,"source":{"id":"https://openalex.org/S93822064","display_name":"Journal of Applied Non-Classical Logics","issn_l":"1166-3081","issn":["1166-3081","1958-5780"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Non-Classical Logics","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/057aa748-f3c2-45bc-a247-9d97e5cf792e","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/057aa748-f3c2-45bc-a247-9d97e5cf792e","pdf_url":null,"source":{"id":"https://openalex.org/S4306402492","display_name":"UWA Profiles and Research Repository (UWA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mccabe-Dansted, J, French, T, Pinchinat, S & Reynolds, M 2015, 'Expressiveness and succinctness of a logic of robustness', Journal of Applied Non-Classical Logics, vol. 25, no. 3, pp. 193-228. https://doi.org/10.1080/11663081.2015.1050907","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W26992193","https://openalex.org/W167442982","https://openalex.org/W184949612","https://openalex.org/W985143224","https://openalex.org/W1482244486","https://openalex.org/W1490858874","https://openalex.org/W1493891971","https://openalex.org/W1499833455","https://openalex.org/W1501952738","https://openalex.org/W1507063113","https://openalex.org/W1530582609","https://openalex.org/W1534088363","https://openalex.org/W1553432043","https://openalex.org/W1564580204","https://openalex.org/W1568806456","https://openalex.org/W1570172018","https://openalex.org/W1572619574","https://openalex.org/W1606781638","https://openalex.org/W1608094044","https://openalex.org/W1666853580","https://openalex.org/W1809956864","https://openalex.org/W1990609140","https://openalex.org/W2004306067","https://openalex.org/W2005998857","https://openalex.org/W2012585852","https://openalex.org/W2023808162","https://openalex.org/W2041403185","https://openalex.org/W2043154866","https://openalex.org/W2054099039","https://openalex.org/W2062458205","https://openalex.org/W2082762653","https://openalex.org/W2084522115","https://openalex.org/W2086440639","https://openalex.org/W2087718129","https://openalex.org/W2095098748","https://openalex.org/W2106878575","https://openalex.org/W2107444004","https://openalex.org/W2112476716","https://openalex.org/W2112535338","https://openalex.org/W2116559492","https://openalex.org/W2117189826","https://openalex.org/W2121503414","https://openalex.org/W2124667596","https://openalex.org/W2130675058","https://openalex.org/W2141881363","https://openalex.org/W2186597297","https://openalex.org/W2318473331","https://openalex.org/W2340735175","https://openalex.org/W2395144056","https://openalex.org/W2502103274","https://openalex.org/W2603686671","https://openalex.org/W2758969507","https://openalex.org/W2913459036","https://openalex.org/W2951982224","https://openalex.org/W3123661950","https://openalex.org/W4247612840","https://openalex.org/W4248447990","https://openalex.org/W4255791525"],"related_works":["https://openalex.org/W2178250883","https://openalex.org/W4285254379","https://openalex.org/W146107827","https://openalex.org/W1973554590","https://openalex.org/W1987761485","https://openalex.org/W4247671148","https://openalex.org/W2963209892","https://openalex.org/W2073812501","https://openalex.org/W4214723139","https://openalex.org/W2381825341"],"abstract_inverted_index":{"This":[0,49],"paper":[1,50,72],"compares":[2],"the":[3,29,32,54,126,129,153,176,179],"recently":[4],"proposed":[5],"Robust":[6],"Full":[7],"Computational":[8],"Tree":[9],"Logic":[10],"(RoCTL*)":[11],"to":[12,63,74,81,173,217],"model":[13],"robustness":[14],"in":[15,122,125,139,152],"concurrent":[16],"systems":[17],"with":[18,28,44,175],"other":[19],"computational":[20],"tree":[21],"logic":[22],"(CTL*)-based":[23],"logics.":[24,223],"RoCTL*":[25,59,77,90,113,201,216],"extends":[26],"CTL*":[27,82,115,209,219],"addition":[30],"of":[31,58,70,128,178],"operators":[33],"Obligatory":[34],"and":[35,42,56,64,221],"Robustly,":[36],"which":[37],"quantify":[38],"over":[39,97],"failure-free":[40],"paths":[41,43],"one":[45],"more":[46,86],"failure":[47],"respectively.":[48],"focuses":[51],"on":[52],"examining":[53],"succinctness":[55],"expressiveness":[57],"by":[60],"presenting":[61],"translations":[62],"from":[65,112],"RoCTL*.":[66],"The":[67],"core":[68],"result":[69,121,138,171],"this":[71,148,170],"is":[73,78,84,150,189,197],"show":[75,146],"that":[76,116,147,155,169,187,200],"expressively":[79],"equivalent":[80],"but":[83,99,119],"non-elementarily":[85],"succinct.":[87],"That":[88],"is,":[89],"does":[91],"not":[92,184],"add":[93],"any":[94,156],"expressive":[95],"power":[96],"CTL*,":[98],"can":[100],"represent":[101],"some":[102],"properties":[103],"using":[104],"vastly":[105],"reduced":[106],"formulae.":[107],"We":[108,213],"present":[109],"a":[110],"translation":[111,149,158],"into":[114],"preserves":[117],"truth":[118],"may":[120,137],"non-elementary":[123],"growth":[124,164],"length":[127,177],"translated":[130,180],"formula,":[131],"as":[132,206,208],"each":[133],"nested":[134,166],"Robustly":[135],"operator":[136],"an":[140,161],"extra":[141,162],"exponential":[142,163],"blowup.":[143],"However,":[144],"we":[145],"optimal":[151],"sense":[154],"equivalence-preserving":[157],"will":[159],"require":[160],"per":[165],"Robustly.":[167],"Note":[168],"has":[172,183],"do":[174],"formula.":[181],"It":[182],"been":[185],"proved":[186],"there":[188],"no":[190],"elementary":[191],"decision":[192],"procedure":[193],"for":[194],"RoCTL*;":[195],"it":[196],"only":[198],"known":[199],"must":[202],"be":[203],"at":[204],"least":[205],"hard":[207],"(i.e.,":[210],"double":[211],"exponential).":[212],"also":[214],"compare":[215],"Quantified":[218],"(QCTL*)":[220],"hybrid":[222]},"counts_by_year":[{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}