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...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 21, Issue 1
Hlavní autori:	Fortin, Marie, Kuijer, Louwe B., Totzke, Patrick, Zimmermann, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science Association 01.01.2025 Logical Methods in Computer Science e.V
Predmet:	Computer Science computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!