An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information
From MaRDI portal
Publication:6098854
DOI10.1016/j.artint.2022.103847OpenAlexW4313495421MaRDI QIDQ6098854
Francesco Belardinelli, Angelo Ferrando, Vadim Malvone
Publication date: 19 June 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103847
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved model checking of hierarchical systems
- Verification of multi-agent systems with public actions against strategy logic
- Solving games via three-valued abstraction refinement
- Approximate verification of strategic abilities under imperfect information
- Comparing semantics of logics for multi-agent systems
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- A Three-Value Abstraction Technique for the Verification of Epistemic Properties in Multi-agent Systems
- Reasoning About Strategies
- Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems
- Abstraction Refinement for Games with Incomplete Information.
- Alternating-time temporal logic
- Strategy Logic
- A Modal Logic for Coalitional Power in Games
- Multi-valued Verification of Strategic Ability
- Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
- Towards Partial Order Reductions for Strategic Ability
- A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
- Tools and Algorithms for the Construction and Analysis of Systems
- Lattice Automata