Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
From MaRDI portal
Publication:3601787
DOI10.1007/978-3-540-93920-7_6zbMath1207.68403MaRDI QIDQ3601787
Catalin Dima, Dimitar P. Guelev
Publication date: 12 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-93920-7_6
68T30: Knowledge representation
68Q60: Specification and verification (program logics, model checking, etc.)
03B44: Temporal logic
68T42: Agent technology and artificial intelligence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of temporal logics with past
- Results on the propositional \(\mu\)-calculus
- Infinite trees and automaton-definable relations over \(\omega\)-words
- Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
- Specification in CTL + past for verification in CTL.
- Complete axiomatization and decidability of alternating-time temporal logic
- Comparing semantics of logics for multi-agent systems
- Model checking abilities of agents: a closer look
- An axiomatization of PCTL*
- Alternating-time temporal logic
- Constructive knowledge: what agents can achieve under imperfect information
- Algorithms for Omega-Regular Games with Imperfect Information
- Model Checking on Trees with Path Equivalences
