Easy Yet Hard: Model Checking Strategies of Agents

DOI10.1007/978-3-642-02734-5_1MaRDI QIDQ3393378zbMATH OpenOpenAlexFDO

Authors Wojciech Jamroga

Publication date 20 August 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-642-02734-5_1

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Agent technology and artificial intelligence (68T42)

Recommendations

• Model Checking Logics of Strategic Ability: Complexity*
• Theoretical Computer Science
• Model checking abilities of agents: a closer look
• scientific article; zbMATH DE number 2196601
• Reasoning about strategies: on the model-checking problem

Cites work

• “Sometimes” and “not never” revisited
• About the expressive power of CTL combinators
• Alternating-time logic with imperfect recall
• Alternating-time temporal logic
• An automata-theoretic approach to branching-time model checking
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• Model checking abilities of agents: a closer look
• On the Expressiveness and Complexity of ATL

Cited in

(3)

• Specification and Verification of Multi-Agent Systems
• scientific article; zbMATH DE number 7533366 (Why is no real title available?)
• Theoretical Computer Science

This page was built for publication: Easy Yet Hard: Model Checking Strategies of Agents

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