{"id":"https://openalex.org/W2143564693","doi":"https://doi.org/10.1109/lics.2006.34","title":"Memoryful Branching-Time Logic","display_name":"Memoryful Branching-Time Logic","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W2143564693","doi":"https://doi.org/10.1109/lics.2006.34","mag":"2143564693"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2006.34","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2006.34","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","raw_type":"proceedings-article"},"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/A5077429082","display_name":"Orna Kupferman","orcid":"https://orcid.org/0000-0003-4699-6117"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"O. Kupferman","raw_affiliation_strings":["School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel","Hebrew Univ. (Israel)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"Hebrew Univ. (Israel)","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000059818","display_name":"Moshe Y. Vardi","orcid":"https://orcid.org/0000-0002-0661-5773"},"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/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.Y. Vardi","raw_affiliation_strings":["Microsoft Research, Department of Computer Science, Rice University, Houston, TX, USA","Rice University, USA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Department of Computer Science, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I74775410"]},{"raw_affiliation_string":"Rice University, USA,","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5934,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.96971681,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"265","last_page":"274"},"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.9990000128746033,"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.995199978351593,"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/computation-tree-logic","display_name":"Computation tree logic","score":0.7423202991485596},{"id":"https://openalex.org/keywords/ctl*","display_name":"CTL*","score":0.6637911200523376},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6497815847396851},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5800424218177795},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5784142017364502},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5540465712547302},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5134583115577698},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4981362819671631},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49451491236686707},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4863031804561615},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4560040235519409},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45168453454971313},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44246381521224976},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43076181411743164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42332810163497925},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4216788113117218},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34486478567123413},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2967255115509033}],"concepts":[{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.7423202991485596},{"id":"https://openalex.org/C147969180","wikidata":"https://www.wikidata.org/wiki/Q5014579","display_name":"CTL*","level":4,"score":0.6637911200523376},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6497815847396851},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5800424218177795},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5784142017364502},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5540465712547302},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5134583115577698},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4981362819671631},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49451491236686707},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4863031804561615},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4560040235519409},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45168453454971313},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44246381521224976},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43076181411743164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42332810163497925},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4216788113117218},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34486478567123413},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2967255115509033},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2006.34","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2006.34","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6299999952316284,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":70,"referenced_works":["https://openalex.org/W4789806","https://openalex.org/W61142406","https://openalex.org/W133833791","https://openalex.org/W185167655","https://openalex.org/W1484484613","https://openalex.org/W1484584685","https://openalex.org/W1487199072","https://openalex.org/W1489227129","https://openalex.org/W1489630028","https://openalex.org/W1501731334","https://openalex.org/W1503002024","https://openalex.org/W1506588809","https://openalex.org/W1527293087","https://openalex.org/W1527405706","https://openalex.org/W1545354279","https://openalex.org/W1552135236","https://openalex.org/W1560050980","https://openalex.org/W1562347120","https://openalex.org/W1753324106","https://openalex.org/W1755189310","https://openalex.org/W1975657455","https://openalex.org/W1988808695","https://openalex.org/W1990609140","https://openalex.org/W1996207810","https://openalex.org/W1997420616","https://openalex.org/W2003227046","https://openalex.org/W2004306067","https://openalex.org/W2015640848","https://openalex.org/W2016206563","https://openalex.org/W2023808162","https://openalex.org/W2030926579","https://openalex.org/W2032189196","https://openalex.org/W2033657926","https://openalex.org/W2054801208","https://openalex.org/W2059221592","https://openalex.org/W2072887965","https://openalex.org/W2075664249","https://openalex.org/W2075920544","https://openalex.org/W2083398633","https://openalex.org/W2093916942","https://openalex.org/W2103146530","https://openalex.org/W2117189826","https://openalex.org/W2124876285","https://openalex.org/W2129495578","https://openalex.org/W2137865376","https://openalex.org/W2140616794","https://openalex.org/W2141088850","https://openalex.org/W2152700389","https://openalex.org/W2154800923","https://openalex.org/W2163151383","https://openalex.org/W2166971042","https://openalex.org/W2171356742","https://openalex.org/W2337392266","https://openalex.org/W2612211757","https://openalex.org/W2986444891","https://openalex.org/W4387892784","https://openalex.org/W6628897293","https://openalex.org/W6629391755","https://openalex.org/W6629461438","https://openalex.org/W6630053826","https://openalex.org/W6632576102","https://openalex.org/W6633746401","https://openalex.org/W6637713663","https://openalex.org/W6637730967","https://openalex.org/W6644513074","https://openalex.org/W6658756224","https://openalex.org/W6676710300","https://openalex.org/W6678534848","https://openalex.org/W6844743626","https://openalex.org/W6995440187"],"related_works":["https://openalex.org/W1532447905","https://openalex.org/W858755136","https://openalex.org/W1981889059","https://openalex.org/W3005864166","https://openalex.org/W2143025323","https://openalex.org/W31328628","https://openalex.org/W3091862538","https://openalex.org/W3163822336","https://openalex.org/W4312622265","https://openalex.org/W2031528374"],"abstract_inverted_index":{"Traditional":[0],"branching-time":[1,98,234],"logics":[2,198],"such":[3,55,86],"as":[4,114],"CTL*":[5,36],"are":[6,174,186],"memoryless:":[7],"once":[8],"a":[9,18,56,62,66,72,232],"path":[10,73,246],"in":[11,32],"the":[12,21,77,80,90,96,124,131,139,145,178,206,241],"computation":[13,22,67],"tree":[14,68,81],"is":[15,28,71,113,133,150,162,221,236],"quantified":[16],"at":[17,61,76],"given":[19],"node,":[20],"that":[23,26,35,42,87,111,123,156,168,229],"led":[24],"to":[25,44,128,130,181,196,211,218],"node":[27,63],"forgotten.":[29],"Recent":[30],"work":[31],"planning":[33],"suggests":[34],"cannot":[37],"easily":[38],"express":[39],"temporal":[40],"goals":[41,48],"refer":[43,129],"whole":[45],"computations.":[46],"Such":[47],"require":[49],"memoryful":[50,57,97,183,233],"quantification":[51],"of":[52,65,79,126,142,157,169,213,244],"paths.":[53],"With":[54],"quantification,":[58,184],"Epsi":[59],"holds":[60],"s":[64,85],"if":[69],"there":[70],"pi":[74,88],"starting":[75],"root":[78],"and":[82,101,106,122,185,227],"going":[83],"through":[84],"satisfies":[89],"linear-time":[91,242],"formula":[92],"psi.":[93],"We":[94,109],"define":[95],"logic":[99,235,243],"mCTL*":[100,112,127,149,195],"study":[102],"its":[103,159,245],"expressive":[104],"power":[105],"algorithmic":[107,140],"properties.":[108],"show":[110],"expressive,":[115],"but":[116],"exponentially":[117,165],"more":[118,188],"succinct,":[119],"than":[120,155,167,190,238],"CTL*,":[121,158],"ability":[125],"present":[132],"essential":[134],"for":[135,148,205,223],"this":[136],"equivalence.":[137],"From":[138],"point":[141],"view,":[143],"while":[144],"satisfiability":[146],"problem":[147,161,208],"2EXPTIME-complete":[151],"-":[152,164],"not":[153],"harder":[154,166,237],"model-checking":[160,207],"EXPSPACE-complete":[163],"CTL*.":[170],"The":[171,201],"upper":[172],"bounds":[173],"obtained":[175,192],"by":[176,193],"extending":[177],"automata-theoretic":[179],"approach":[180],"handle":[182],"much":[187],"efficient":[189],"these":[191],"translating":[194],"branching":[197],"with":[199],"past.":[200],"EXPSPACE":[202],"lower":[203],"bound":[204],"applies":[209],"already":[210],"formulas":[212,247],"restricted":[214],"form":[215],"(in":[216],"particular,":[217],"AGEpsi,":[219],"which":[220],"useful":[222],"specifying":[224],"possibility":[225],"properties),":[226],"implies":[228],"reasoning":[230,239],"about":[231,240]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}