Title | ||
---|---|---|
Reasoning about memoryless strategies under partial observability and unconditional fairness constraints |
Abstract | ||
---|---|---|
Alternating-time Temporal Logic is a logic to reason about strategies that agents can adopt to achieve a specified collective goal.A number of extensions for this logic exist; some of them combine strategies and partial observability, some others include fairness constraints, but to the best of our knowledge no work provides a unified framework for strategies, partial observability and fairness constraints. Integration of these three concepts is important when reasoning about the capabilities of agents without full knowledge of a system, for instance when the agents can assume that the environment behaves in a fair way.We present ATLK irF , a logic combining strategies under partial observability in a system with fairness constraints on states. We introduce a model-checking algorithm for ATLK irF by extending the algorithm for a full-observability variant of the logic and we investigate its complexity. We validate our proposal with an experimental evaluation. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1016/j.ic.2015.03.014 | Information and Computation |
Keywords | Field | DocType |
Alternating-time temporal logic,Partial observability,Fairness constraints,Model checking | Discrete mathematics,Mathematical optimization,Observability,Model checking,Alternating-time Temporal Logic,Temporal logic,Mathematics | Journal |
Volume | Issue | ISSN |
242 | C | 0890-5401 |
Citations | PageRank | References |
8 | 0.46 | 19 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Simon Busard | 1 | 40 | 3.91 |
Charles Pecheur | 2 | 284 | 28.50 |
Hongyang Qu | 3 | 592 | 35.13 |
Franco Raimondi | 4 | 832 | 48.18 |