Substructure Temporal Logic

DOI10.1109/LICS.2013.43MaRDI QIDQ5271074zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Temporal Logics
• scientific article; zbMATH DE number 1749195
• Timed temporal logics
• Temporal and dynamic logic
• scientific article; zbMATH DE number 6287569
• scientific article; zbMATH DE number 4182845
• A temporal module for logical frameworks
• scientific article; zbMATH DE number 4119592
• Timed context-free temporal logics
• The properties of sets of temporal logic subformulas

Cited in

(11)

• Solving parity games via priority promotion
• A delayed promotion policy for parity games
• Robust worst cases for parity games algorithms
• Reasoning about strategies: on the model-checking problem
• Reasoning About Substructures and Games
• scientific article; zbMATH DE number 7445162 (Why is no real title available?)
• Good-for-Game QPTL: An Alternating Hodges Semantics
• Taming strategy logic: non-recurrent fragments
• Priority promotion with Parysian flair
• Automata-theoretic characterisations of branching-time temporal logics
• On modal logics of model-theoretic relations

This page was built for publication: Substructure Temporal Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271074)