Alternating-time temporal logics with linear past
type: Item
instance of: scholarly article
title: Alternating-time temporal logics with linear past
zbMATH Open document ID: 1433.03050
author: Laura Bozzelli
author: Aniello Murano
author: Loredana Sorrentino
published in: Theoretical Computer Science
publication date: 2020-04-21T00:00:00Z
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 7191315
zbMATH Keywords: alternating-time temporal logic
zbMATH Keywords: multi-agent systems
zbMATH Keywords: formal verification
zbMATH Keywords: strategic reasoning
zbMATH Keywords: logics with past modalities
describes a project that uses: MCMAS
MaRDI profile type: Publication
full work available at URL: j.tcs.2019.11.028
OpenAlex ID: W2996139545
cites work: Q5322945
cites work: Q3336675
cites work: “Sometimes” and “not never” revisited
cites work: Alternating-time temporal logic
cites work: Q3384177
cites work: ATL with Strategy Contexts and Bounded Memory
cites work: Strategy logic
cites work: Q3388747
cites work: Reasoning About Strategies
cites work: Relentful strategic reasoning in alternating-time temporal logic
cites work: The Complexity of Enriched Mu-Calculi
cites work: The Complexity of CTL* + Linear Past
cites work: Q3768883
cites work: \textit{Once} and \textit{for all}
cites work: A hierarchy of temporal logics with past
cites work: Specification in CTL + past for verification in CTL.
cites work: Q4219045
cites work: An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
cites work: Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
cites work: Q5715677
cites work: Q2999111
cites work: Characterising Responsibility in Organisational Structures: The Problem of Many Hands
cites work: Coalitional Responsibility in Strategic Settings
cites work: The complexity of propositional linear temporal logics in simple cases
cites work: Automata for the modal μ-calculus and related results
cites work: An automata-theoretic approach to branching-time model checking
cites work: ATL* Satisfiability Is 2EXPTIME-Complete
cites work: Q4542592
cites work: Reasoning about infinite computations
cites work: Alternation
cites work: Q2980973
cites work: Q5144683
cites work: Practical verification of multi-agent systems against \textsc{Slk} specifications
DOI: 10.1016/J.TCS.2019.11.028
description: scientific article; zbMATH DE number 7191315