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!

Be the first to leave a comment!