Results on alternating-time temporal logics with linear past

DOI10.4230/LIPICS.TIME.2018.6MaRDI QIDQ5079770zbMATH OpenFDO

Authors Laura Bozzelli, Aniello Murano, Loredana Sorrentino

Publication date 28 May 2022

zbMATH Keywords

model checkingalternating-time temporal logicslinear past

Mathematics Subject Classification ID

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

Recommendations

• Alternating-time temporal logics with linear past
• Relentful strategic reasoning in alternating-time temporal logic
• The Complexity of CTL* + Linear Past
• Relentful strategic reasoning in alternating-time temporal logic
• Logics in computer science. A study on extensions of temporal and strategic logics

Cites work

• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 4027441 (Why is no real title available?)
• scientific article; zbMATH DE number 1223729 (Why is no real title available?)
• scientific article; zbMATH DE number 1775458 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A hierarchy of temporal logics with past
• ATL with Strategy Contexts and Bounded Memory
• ATL* Satisfiability Is 2EXPTIME-Complete
• Alternating-time temporal logic
• Alternation
• An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
• An automata-theoretic approach to branching-time model checking
• Automata for the modal \(\mu \)-calculus and related results
• On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking
• Reasoning about infinite computations
• Reasoning about strategies: on the model-checking problem
• Relentful strategic reasoning in alternating-time temporal logic
• Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
• Specification in CTL + past for verification in CTL.
• Strategy logic
• The Complexity of CTL* + Linear Past
• \textit{Once} and \textit{for all}
• “Sometimes” and “not never” revisited

Cited in

(7)

• Relentful strategic reasoning in alternating-time temporal logic
• Alternating-time temporal logics with linear past
• An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
• Relentful strategic reasoning in alternating-time temporal logic
• The Complexity of CTL* + Linear Past
• An algebraic study of tense logics with linear time
• Past is for free: On the complexity of verifying linear temporal properties with past

This page was built for publication: Results on alternating-time temporal logics with linear past

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