Reasoning about Strategies under Partial Observability and Fairness Constraints
Simon Busard, Charles Pecheur, Hongyang Qu and 1 more
Electronic Proceedings in Theoretical Computer Science · 2013
doi:10.4204/eptcs.112.12 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
A number of extensions exist for Alternating-time Temporal Logic; some of these mix strategies and partial observability but, to the best of our knowledge, no work provides a unified framework for strategies, partial observability and fairness constraints. In this paper we propose ATLK^F_po, a logic mixing strategies under partial observability and epistemic properties of agents in a system with fairness constraints on states, and we provide a model checking algorithm for it.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.