Results on alternating-time temporal logics with linear past
From MaRDI portal
Publication:5079770
DOI10.4230/LIPICS.TIME.2018.6zbMATH Open1487.68155MaRDI QIDQ5079770FDOQ5079770
Authors: Laura Bozzelli, Aniello Murano, Loredana Sorrentino
Publication date: 28 May 2022
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Alternating-time temporal logic
- Title not available (Why is that?)
- Alternation
- Title not available (Why is that?)
- “Sometimes” and “not never” revisited
- A hierarchy of temporal logics with past
- Reasoning about infinite computations
- Title not available (Why is that?)
- An automata-theoretic approach to branching-time model checking
- Reasoning about strategies: on the model-checking problem
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- Strategy logic
- Automata for the modal \(\mu \)-calculus and related results
- Title not available (Why is that?)
- Specification in CTL + past for verification in CTL.
- Title not available (Why is that?)
- \textit{Once} and \textit{for all}
- The Complexity of CTL* + Linear Past
- ATL with Strategy Contexts and Bounded Memory
- ATL* Satisfiability Is 2EXPTIME-Complete
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
- Relentful strategic reasoning in alternating-time temporal logic
- On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking
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)