Reasoning about Strategies under Partial Observability and Fairness Constraints

Busard, Simon; Pecheur, Charles; Qu, Hongyang; Raimondi, Franco

doi:10.4204/eptcs.112.12

Cited by 7 publications

(19 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem they solve is a bit different from AT L ir as, for the formula ⟪player⟫F win ∧ ⟪player⟫F lose to be true, the same uniform strategy must be winning for both formulas, while AT L ir allows different strategies to witness the satisfaction. Also, their idea is very similar to the first solution of Busard et al [9,11], shown to be highly ineffective compared to the partial approach [10].…”

Section: Resultsmentioning

confidence: 94%

See 1 more Smart Citation

A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability

Busard

Pecheur

2017

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Since the introduction of Alternating-time Temporal Logic (AT L), many logics have been proposed to reason about different strategic capabilities of the agents of a system. In particular, some logics have been designed to reason about the uniform memoryless strategies of such agents. These strategies are the ones the agents can effectively play by only looking at what they observe from the current state. AT L ir can be seen as the core logic to reason about such uniform strategies. Nevertheless, its model-checking problem is difficult-it requires a polynomial number of calls to an NP oracle-, and practical algorithms to solve it appeared only recently.This paper proposes a technique for model checking uniform memoryless strategies. Existing techniques build the strategies from the states of interest-such as the initial states-through a forward traversal of the system. On the other hand, the proposed approach builds the winning strategies from the target states through a backward traversal, making sure that only uniform strategies are explored. Nevertheless, building the strategies from the ground up limits its applicability to constrained reachability objectives only. This paper describes the approach in details and compares it experimentally with existing approaches implemented into a BDD-based framework. These experiments show that the technique is competitive on the cases it can handle. * This research is financed by the Walloon Region as part of the Logistics in Wallonia competitiveness pole. 1 A ∆ P 2 problem requires a polynomial number of calls to an NP oracle.

show abstract

Section: Resultsmentioning

confidence: 94%

“…These approaches can be improved with pre-filtering, a technique that reduces the number of strategies to consider [9,11]. If some move does not belong to a winning general strategy, then it cannot belong to a uniform winning one.…”

Section: Introductionmentioning

confidence: 99%

A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability

Busard

Pecheur

2017

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The formulas φ i j are called the guards of the knowledge-based program. 8 Intuitively, this program says to repeat forever the following operation: nondeterministically execute one of the actions a i j such that the corresponding guard φ i j is true. To ensure that it is always the case that at least one action enabled, we assume that φ i 1 ∨ .…”

Section: Reasoning About Knowledge-based Programsmentioning

confidence: 99%

“…(b) call S AT (Γ, E, Σ, (t, β), φ 1 ). 8. If φ = ∃x(φ 1 ), then existentially guess a global state (t, β), and universally A straightforward argument based on the semantics of the logic shows that the above correctly computes SAT.…”

Section: Corollarymentioning

confidence: 99%

An Epistemic Strategy Logic

Huang

Meyden

2018

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

This paper presents an extension of temporal epistemic logic with operators that quantify over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitly encode the strategy being used by each of the agents. This provides a natural way to express what agents would know were they to be aware of some of the strategies being used by other agents. A number of examples that rely upon the ability to express an agent's knowledge about the strategies being used by other agents are presented to motivate the framework, including reasoning about game theoretic equilibria, knowledge-based programs, and information theoretic computer security policies. Relationships to several variants of alternating temporal epistemic logic are discussed. The computational complexity of model checking the logic and several of its fragments are also characterized. * This paper combines results from [31] An epistemic strategy logic, X. Huang and R. van der Meyden, 2nd International Workshop on Strategic Reasoning , April 2014, Grenoble, France, and [33] A temporal logic of strategic knowledge, X. Huang and R. van der Meyden, Int. Conf. on Principles of Knowledge Representation and Reasoning, Jul 2014, Vienna. It extends these works by including full proofs for all results. † Email: xiaowei.huang@liverpool.ac.uk. Most of Huang's work was performed when he was at UNSW

show abstract

“…When the fairness options are enabled all operators are evaluated on the set of fair paths as discussed in [9].…”

Section: Fairness For Atlkmentioning

confidence: 99%

MCMAS: an open-source model checker for the verification of multi-agent systems

Lomuscio

Raimondi

2015

Int J Softw Tools Technol Transfer

Self Cite

187

142

View full text Add to dashboard Cite

We present MCMAS, a model checker for the verification of multi-agent systems. MCMAS supports efficient symbolic techniques for the verification of multi-agent systems against specifications representing temporal, epistemic and strategic properties. We present the underlying semantics of the specification language supported and the algorithms implemented in MCMAS, including its fairness and counterexample generation features. We provide a detailed description of the implementation. We illustrate its use by discussing a number of examples and evaluate its performance by comparing it against other model checkers for multi-agent systems on a common case study.

show abstract

Reasoning about Strategies under Partial Observability and Fairness Constraints

Cited by 7 publications

References 9 publications

A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability

A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability

An Epistemic Strategy Logic

MCMAS: an open-source model checker for the verification of multi-agent systems

Contact Info

Product

Resources

About