Substructure Temporal Logic

DOI10.1109/LICS.2013.43zbMath1366.03182OpenAlexW4236652038MaRDI QIDQ5271074

Massimo Benerecetti, Fabio Mogavero, Aniello Murano

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2013.43

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (9)

On modal logics of model-theoretic relations ⋮ Robust worst cases for parity games algorithms ⋮ Reasoning About Strategies ⋮ Taming strategy logic: non-recurrent fragments ⋮ Reasoning About Substructures and Games ⋮ Unnamed Item ⋮ Solving parity games via priority promotion ⋮ A delayed promotion policy for parity games ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics

This page was built for publication: Substructure Temporal Logic