{"id":"https://openalex.org/W7169572378","doi":"https://doi.org/10.48550/arxiv.2607.15223","title":"Disintegration Temporal Logic for Probabilistic Hyperproperties","display_name":"Disintegration Temporal Logic for Probabilistic Hyperproperties","publication_year":2026,"publication_date":"2026-07-16","ids":{"openalex":"https://openalex.org/W7169572378","doi":"https://doi.org/10.48550/arxiv.2607.15223"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.15223","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.15223","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.15223","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5115458452","display_name":"Mishel Carelli","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carelli, Mishel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5141058405","display_name":"Bernd Finkbeiner","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Finkbeiner, Bernd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"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.9136000275611877,"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.9136000275611877,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.011099999770522118,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.009399999864399433,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.8500999808311462},{"id":"https://openalex.org/keywords/probabilistic-ctl","display_name":"Probabilistic CTL","score":0.7443000078201294},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6539999842643738},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6463000178337097},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.638700008392334},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5587000250816345},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5547999739646912},{"id":"https://openalex.org/keywords/probabilistic-argumentation","display_name":"Probabilistic argumentation","score":0.5195000171661377},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.5072000026702881},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4925000071525574}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.8500999808311462},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.7443000078201294},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6539999842643738},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6463000178337097},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.638700008392334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5896000266075134},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5587000250816345},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5547999739646912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5419999957084656},{"id":"https://openalex.org/C128828806","wikidata":"https://www.wikidata.org/wiki/Q7246848","display_name":"Probabilistic argumentation","level":3,"score":0.5195000171661377},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.5072000026702881},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4925000071525574},{"id":"https://openalex.org/C143017306","wikidata":"https://www.wikidata.org/wiki/Q3318133","display_name":"Probabilistic relevance model","level":4,"score":0.4814000129699707},{"id":"https://openalex.org/C44492722","wikidata":"https://www.wikidata.org/wiki/Q327069","display_name":"Conditional probability","level":2,"score":0.4729999899864197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46299999952316284},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4620000123977661},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4481000006198883},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4465000033378601},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4323999881744385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39820000529289246},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3571000099182129},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3440000116825104},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.3384999930858612},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.3231000006198883},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.32019999623298645},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.28040000796318054},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C147080032","wikidata":"https://www.wikidata.org/wiki/Q176720","display_name":"Continuous-time Markov chain","level":5,"score":0.2757999897003174},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.2703000009059906},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.2583000063896179}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.15223","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.15223","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.15223","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.15223","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.7022640109062195,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,76],"introduce":[1],"Disintegration":[2],"Temporal":[3],"Logic":[4],"(DTL),":[5],"a":[6,14,44,53,132],"new":[7],"probabilistic":[8,18,21,94,105,142,151],"temporal":[9],"logic":[10],"that":[11,122,161],"can":[12],"express":[13],"wide":[15],"range":[16],"of":[17,32,49,67,79,89,126],"hyperproperties,":[19],"including":[20],"non-interference":[22],"and":[23,93,99,140,149],"perfect":[24,147],"indistinguishability.":[25],"DTL":[26,80,114],"is":[27,115],"based":[28,136],"on":[29,43,96,137],"the":[30,163],"notion":[31],"measure":[33],"disintegration":[34],"from":[35],"probability":[36,72],"theory,":[37],"which":[38],"allows":[39],"for":[40,166],"conditioning":[41],"probabilities":[42],"finite":[45],"or":[46],"infinite":[47,97],"sequence":[48],"events":[50],"occurring":[51],"during":[52],"program":[54],"execution.":[55],"This":[56],"naturally":[57],"supports":[58],"reasoning":[59,169],"about":[60,170],"interacting":[61,83],"stochastic":[62,85],"systems,":[63],"where":[64],"complete":[65],"executions":[66],"one":[68],"component":[69],"induce":[70],"conditional":[71],"distributions":[73],"over":[74],"another.":[75],"illustrate":[77],"applications":[78],"to":[81,103],"systems":[82],"with":[84,168],"environments,":[86],"distributional":[87],"properties":[88,144],"Markov":[90,110],"decision":[91],"processes,":[92],"automata":[95],"words,":[98],"discuss":[100],"its":[101],"relationship":[102],"existing":[104],"logics.":[106],"While":[107],"model":[108],"checking":[109],"chains":[111],"against":[112],"full":[113],"undecidable,":[116],"we":[117],"identify":[118],"two":[119],"decidable":[120],"fragments":[121],"capture":[123],"many":[124],"hyperproperties":[125],"interest.":[127],"The":[128,153],"linear":[129],"fragment":[130,155],"admits":[131,156],"polynomial-time":[133],"model-checking":[134,159],"procedure":[135,160],"linear-algebraic":[138],"techniques":[139],"captures":[141],"information-flow":[143],"such":[145],"as":[146],"indistinguishability":[148],"history-based":[150],"non-interference.":[152],"qualitative":[154],"an":[157],"automata-theoretic":[158],"extends":[162],"standard":[164],"algorithm":[165],"$\\mathit{HyperCTL}^*$":[167],"bottom":[171],"strongly":[172],"connected":[173],"components.":[174]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-18T00:00:00"}