Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
From MaRDI portal
Publication:5076330
Recommendations
- Reasoning about strategic abilities: agents with truly perfect recall
- Theoretical Computer Science
- Approximate verification of strategic abilities under imperfect information
- Reasoning about strategies: on the model-checking problem
- scientific article; zbMATH DE number 1500666
- Exponential improvement of time complexity of model checking for multiagent systems with perfect recall
- Exponential acceleration of model checking for perfect recall systems
- A logic of strategic ability under bounded memory
- Model Checking Logics of Strategic Ability: Complexity*
Cited in
(7)- Exponential improvement of time complexity of model checking for multiagent systems with perfect recall
- scientific article; zbMATH DE number 7533366 (Why is no real title available?)
- An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information
- Runtime Verification with Imperfect Information Through Indistinguishability Relations
- A formal approach to attack graphs
- Reasoning about decidability of strategic logics with imperfect information and perfect recall strategies
- Model-checking strategic abilities in information-sharing systems
This page was built for publication: Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076330)
