The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas

DOI10.4230/LIPIcs.CSL.2020.29OpenAlexW3003336482MaRDI QIDQ5874216

Martín G. Zimmermann, Corto N. Mascle

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/1907.05070

zbMATH Keywords

satisfiabilitylinear temporal logichyperproperties

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

On the complexity of linear temporal logic with team semantics

This page was built for publication: The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas