Easy Yet Hard: Model Checking Strategies of Agents

DOI10.1007/978-3-642-02734-5_1zbMath1250.68189OpenAlexW1506774075MaRDI QIDQ3393378

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)

Related Items (1)

Specification and Verification of Multi-Agent Systems

Cites Work

• Unnamed Item
• Unnamed Item
• About the expressive power of CTL combinators
• Model checking abilities of agents: a closer look
• Alternating-time temporal logic
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• “Sometimes” and “not never” revisited
• An automata-theoretic approach to branching-time model checking
• On the Expressiveness and Complexity of ATL

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