HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^$ is Even Harder

Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace quantification. It is known that this expressiveness comes...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science Vol. 21, Issue 1
Main Authors: Fortin, Marie, Kuijer, Louwe B., Totzke, Patrick, Zimmermann, Martin
Format: Journal Article
Language:English
Published: Logical Methods in Computer Science Association 01.01.2025
Logical Methods in Computer Science e.V
Subjects:
Computer Science
computer science - logic in computer science
ISSN:1860-5974, 1860-5974
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace quantification. It is known that this expressiveness comes at a price, i.e. satisfiability is undecidable for both logics. In this paper we settle the exact complexity of these problems, showing that both are in fact highly undecidable: we prove that HyperLTL satisfiability is $\Sigma_1^1$-complete and HyperCTL* satisfiability is $\Sigma_1^2$-complete. These are significant increases over the previously known lower bounds and the first upper bounds. To prove $\Sigma_1^2$-membership for HyperCTL*, we prove that every satisfiable HyperCTL* sentence has a model that is equinumerous to the continuum, the first upper bound of this kind. We also prove this bound to be tight. Furthermore, we prove that both countable and finitely-branching satisfiability for HyperCTL* are as hard as truth in second-order arithmetic, i.e. still highly undecidable. Finally, we show that the membership problem for every level of the HyperLTL quantifier alternation hierarchy is $\Pi_1^1$-complete. Comment: arXiv admin note: substantial text overlap with arXiv:2105.04176
AbstractList Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace quantification. It is known that this expressiveness comes at a price, i.e. satisfiability is undecidable for both logics. In this paper we settle the exact complexity of these problems, showing that both are in fact highly undecidable: we prove that HyperLTL satisfiability is $\Sigma_1^1$-complete and HyperCTL* satisfiability is $\Sigma_1^2$-complete. These are significant increases over the previously known lower bounds and the first upper bounds. To prove $\Sigma_1^2$-membership for HyperCTL*, we prove that every satisfiable HyperCTL* sentence has a model that is equinumerous to the continuum, the first upper bound of this kind. We also prove this bound to be tight. Furthermore, we prove that both countable and finitely-branching satisfiability for HyperCTL* are as hard as truth in second-order arithmetic, i.e. still highly undecidable. Finally, we show that the membership problem for every level of the HyperLTL quantifier alternation hierarchy is $\Pi_1^1$-complete. Comment: arXiv admin note: substantial text overlap with arXiv:2105.04176
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace quantification. It is known that this expressiveness comes at a price, i.e. satisfiability is undecidable for both logics. In this paper we settle the exact complexity of these problems, showing that both are in fact highly undecidable: we prove that HyperLTL satisfiability is $\Sigma_1^1$-complete and HyperCTL* satisfiability is $\Sigma_1^2$-complete. These are significant increases over the previously known lower bounds and the first upper bounds. To prove $\Sigma_1^2$-membership for HyperCTL*, we prove that every satisfiable HyperCTL* sentence has a model that is equinumerous to the continuum, the first upper bound of this kind. We also prove this bound to be tight. Furthermore, we prove that both countable and finitely-branching satisfiability for HyperCTL* are as hard as truth in second-order arithmetic, i.e. still highly undecidable. Finally, we show that the membership problem for every level of the HyperLTL quantifier alternation hierarchy is $\Pi_1^1$-complete.
Author Totzke, Patrick
Fortin, Marie
Zimmermann, Martin
Kuijer, Louwe B.
Author_xml – sequence: 1
  givenname: Marie
  surname: Fortin
  fullname: Fortin, Marie
– sequence: 2
  givenname: Louwe B.
  surname: Kuijer
  fullname: Kuijer, Louwe B.
– sequence: 3
  givenname: Patrick
  surname: Totzke
  fullname: Totzke, Patrick
– sequence: 4
  givenname: Martin
  surname: Zimmermann
  fullname: Zimmermann, Martin
BackLink https://hal.science/hal-05354525$$DView record in HAL
BookMark eNpVkc1PAjEQxRujiYj8Ad72wEESVzv92A9vhKBLsokH4Woz222hZGFJS0j4713AGJ3LTN5787u8O3K9bbeGkAegzyJhefbSbHSIGTzCKx8xyuQV6UGW0Fjmqbj-c9-SQQhr2g3nkLGkR2bFcWd8OS-jT9y7YB1WrnH7YzQLUeGWq-YYLba10a7GqjFP0Tk-mZfDr2HkQjQ9mG1UoK-Nvyc3FptgBj-7TxZv0_mkiMuP99lkXMaaC7qPGcUkN5onNcUamBEgWJUwBkLazAiT5VqgrTjYXGqKkgqrbZV2VqolUOR9Mrtw6xbXaufdBv1RtejUWWj9UqHfO90YJVOKusbUQp0KLXnWUTWVUJ3IqbYda3RhrbD5hyrGpTppVHIpJJMH6LJwyWrfhuCN_X0Aqs41qFMNioECxdWpBv4Nfzh7Mw
ContentType Journal Article
Copyright licence_http://creativecommons.org/publicdomain/zero
Copyright_xml – notice: licence_http://creativecommons.org/publicdomain/zero
DBID AAYXX
CITATION
1XC
DOA
DOI 10.46298/lmcs-21(1:3)2025
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_570acda7f1d74c53831fc051b5c0a7cf
oai:HAL:hal-05354525v1
10_46298_lmcs_21_1_3_2025
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
1XC
ID FETCH-LOGICAL-c340t-20a69ec36d0ad12e4142b622145f8e4e89c4afb31f95c0a504fcfb78e47c510a3
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001395058900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1860-5974
IngestDate Fri Oct 03 12:53:36 EDT 2025
Sat Nov 22 06:21:15 EST 2025
Sat Nov 29 06:21:52 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License licence_http://creativecommons.org/publicdomain/zero/: http://creativecommons.org/publicdomain/zero
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c340t-20a69ec36d0ad12e4142b622145f8e4e89c4afb31f95c0a504fcfb78e47c510a3
OpenAccessLink https://doaj.org/article/570acda7f1d74c53831fc051b5c0a7cf
ParticipantIDs doaj_primary_oai_doaj_org_article_570acda7f1d74c53831fc051b5c0a7cf
hal_primary_oai_HAL_hal_05354525v1
crossref_primary_10_46298_lmcs_21_1_3_2025
PublicationCentury 2000
PublicationDate 2025-01-01
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – month: 01
  year: 2025
  text: 2025-01-01
  day: 01
PublicationDecade 2020
PublicationTitle Logical methods in computer science
PublicationYear 2025
Publisher Logical Methods in Computer Science Association
Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science Association
– name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.3644423
Snippet Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most...
SourceID doaj
hal
crossref
SourceType Open Website
Open Access Repository
Index Database
SubjectTerms Computer Science
computer science - logic in computer science
Title HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^$ is Even Harder
URI https://hal.science/hal-05354525
https://doaj.org/article/570acda7f1d74c53831fc051b5c0a7cf
Volume 21, Issue 1
WOSCitedRecordID wos001395058900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5SPHjxLdYXQXpQcXGzSXc33qpUKqwiWMGTIZsHFmqVthZ68bc7k23Fnrx42UM2ZJdvJsl8eXxDSENm1jvwjchpL4GgeBvlZVpGXPtYel5K74JkfpHd3-fPz_LhV6ovPBNWyQNXwAFhj7WxOvPMZsJA9-TMG_CksmlinRmPoy9EPb_IVBiDOcfAudrGFGki84v-mxlFCTthl_wUGH9zYSIKev0wvbzOl1PD9HKzTlZncSFtVf-zQZbcYJOszXMu0FkX3CK3HSCOw6Jb0MdwL6FX6WxP6e2I4pmN_pRiKiPTs3gn6pyG6tfdovHSoL0RbcPYRnG33g23ydNNu3vdiWbpECLDRTwGf9apdIanNtaWJU4wkZRpglLjPnfC5dII7UvARyI2zVh448sMXmUGep7mO6Q2eB-4XUJ1qr3PLYAkUgGERWcQJTahVWmt0ILXydkcG_VRqV4oYAsBSIVAqoQpprhCIOvkCtH7qYiC1aEAzKhmZlR_mbFOjgH7hTY6rUJhGSrQ4O7rhO39x5f2yQr-dbWMckBq4-GnOyTLZgJGGx4FN4Ln3Vf7G8tYzL0
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=HyperLTL+Satisfiability+Is+Highly+Undecidable%2C+HyperCTL%24%5E%24+is+Even+Harder&rft.jtitle=Logical+methods+in+computer+science&rft.au=Fortin%2C+Marie&rft.au=Kuijer%2C+Louwe+B.&rft.au=Totzke%2C+Patrick&rft.au=Zimmermann%2C+Martin&rft.date=2025-01-01&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=21%2C+Issue+1&rft_id=info:doi/10.46298%2Flmcs-21%281%3A3%292025&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_21_1_3_2025
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon