scientific article; zbMATH DE number 7533369
From MaRDI portal
Publication:5079770
DOI10.4230/LIPIcs.TIME.2018.6zbMath1487.68155MaRDI QIDQ5079770
Loredana Sorrentino, Laura Bozzelli, Aniello Murano
Publication date: 28 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \textit{Once} and \textit{for all}
- A hierarchy of temporal logics with past
- Strategy logic
- Reasoning about infinite computations
- Specification in CTL + past for verification in CTL.
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
- Reasoning About Strategies
- Relentful strategic reasoning in alternating-time temporal logic
- Alternating-time temporal logic
- ATL* Satisfiability Is 2EXPTIME-Complete
- Automata for the modal μ-calculus and related results
- ATL with Strategy Contexts and Bounded Memory
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- “Sometimes” and “not never” revisited
- Alternation
- An automata-theoretic approach to branching-time model checking
- The Complexity of CTL* + Linear Past
This page was built for publication:
