Specification and Verification of Multi-Agent Systems
From MaRDI portal
Publication:3166991
DOI10.1007/978-3-642-31485-8_6zbMath1250.68190OpenAlexW1560985252MaRDI QIDQ3166991
Wojciech Jamroga, Wojciech Penczek
Publication date: 1 November 2012
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-31485-8_6
Game theory (91A99) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60) Social choice (91B14) Agent technology and artificial intelligence (68T42)
Related Items (2)
From model checking to equilibrium checking: reactive modules for rational verification ⋮ A first-order coalition logic for BDI-agents
Uses Software
Cites Work
- Results on the propositional \(\mu\)-calculus
- Reasoning about temporal properties of rational play
- Number of quantifiers is better than number of tape cells
- Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
- Modalities for model checking: Branching time logic strikes back
- Complete axiomatization and decidability of alternating-time temporal logic
- Model checking abilities of agents: a closer look
- Advances in verification of time Petri nets and timed automata. A temporal logic approach.
- Action and knowledge in alternating-time temporal logic
- Model checking discounted temporal properties
- Intention is choice with commitment
- A lattice-theoretical fixpoint theorem and its applications
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
- Model Checking Logics of Strategic Ability: Complexity*
- Parity, circuits, and the polynomial-time hierarchy
- Easy Yet Hard: Model Checking Strategies of Agents
- Alternating-time temporal logic
- On the Expressiveness and Complexity of ATL
- Essentials of Game Theory: A Concise Multidisciplinary Introduction
- Implementing Temporal Logics: Tools for Execution and Proof
- Constructive knowledge: what agents can achieve under imperfect information
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Deciding full branching time logic
- “Sometimes” and “not never” revisited
- The complexity of propositional linear temporal logics
- On the menbership problem for functional and multivalued dependencies in relational databases
- Logic in Computer Science
- An automata-theoretic approach to branching-time model checking
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Modal and temporal properties of processes
- Lower bounds for multiplayer noncooperative games of incomplete information
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Specification and Verification of Multi-Agent Systems
