• Corpus ID: 63125214

A Model Checker for Strategy Logic

@inproceedings{Lomuscio2014AMC,
  title={A Model Checker for Strategy Logic},
  author={Alessio Lomuscio},
  year={2014}
}
There is a gap between game theory and practical model checking. Although logics for expressing gametheoretic concepts like Nash equilibria, notably Strategy Logic (Sl), have been put forward recently, there are currently no tools supporting them. This report documents the design of the first practical model checking algorithms for two fragments of Sl and their symbolic implementation using binary decision diagrams. We explain how we incorporated both algorithms in the existing model checker… 
Verifying and Synthesising Multi-Agent Systems against One-Goal Strategy Logic Specifications
TLDR
This paper puts forward an automata-based methodology for verifying and synthesising multi-agent systems against specifications given in SL[1G], and shows that the algorithm is sound and optimal from a computational point of view.
Model Checking Pushdown Epistemic Game Structures
TLDR
This paper introduces pushdown epistemic game structures (PEGSs), an extension of pushdown game structures with epistemic accessibility relations (EARs), and proposes regular EARs, and provides automata-theoretic model checking algorithms with matching low bounds.
An Epistemic Strategy Logic 1
TLDR
An extension of temporal epistemic logic with operators that can express quantification over agent strategies is presented, with results that provide a natural way to express what agents would know were they to be aware of some of the strategies being used by other agents.
An Epistemic Strategy Logic
TLDR
An extension of temporal epistemic logic with operators that can express quantification over agent strategies is presented, which 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.
Verification of Broadcasting Multi-Agent Systems against an Epistemic Strategy Logic
TLDR
This work defines an epistemic extension of strategy logic with incomplete information and the assumption of uniform and coherent strategies and proves that the model checking problem, and thus rational synthesis, is non-elementary decidable.

References

SHOWING 1-10 OF 69 REFERENCES
Model Checking Logics of Strategic Ability: Complexity*
TLDR
This chapter is about model checking and its complexity in some of the main temporal and strategic logics, e.g. LTL, CTL, and ATL and summarizes some results about higher order representations of the underlying models.
Bounded Model Checking for the Universal Fragment of CTL
TLDR
The concept of bounded model checking can be extended to ACTL (the universal fragment of CTL) and the implementation of the algorithm for Elementary Net Systems is described together with the experimental results.
MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications
TLDR
Much of current work involves refining and improving existing techniques such as predicate abstraction, which are increasingly used in industrial setting to verify hardware and software systems, both against models and concrete implementations.
Solving Parity Games in Practice
TLDR
A generic solver is presented that intertwines optimisations with any of the existing parity game algorithms which is only called on parts of a game that cannot be solved faster by simpler methods, showing that using this approach vastly speeds up the solving process.
On Model-Checking for Fragments of µ-Calculus
TLDR
It is shown that the logic L2 is as expressive as ECTL* given in [13], and the model checking problem for the μ-calculus is equivalent to the non-emptiness problem of parity tree automata.
Small Progress Measures for Solving Parity Games
TLDR
A new algorithm for deciding the winner in parity games, and hence also for the modal µ-calculus model checking, based on a notion of game progress measures, characterized as pre-fixed points of certain monotone operators on a complete lattice.
A Decidable Fragment of Strategy Logic
TLDR
One-Goal Strategy Logic is introduced and it is proved that, unlike SL, it has the bounded tree-model property and its satisfiability problem is decidable in 2ExpTime, thus not harder than the one for ATL*.
Modalities for Model Checking: Branching Time Logic Strikes Back
Improving the Encoding of LTL Model Checking into SAT
TLDR
This paper tackles the problem of improving BMC encodings for the full class of LTL properties by noticing some properties of the encoding of [2], and exploiting them to define improvements that make the resulting boolean formulas smaller or simpler to solve.
What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
TLDR
This work introduces and studies the syntactic fragment One-Goal Strategy Logic, which consists of formulas in prenex normal form having a single temporal goal at a time for every strategy quantification of agents, and shows that Sl[1g] is strictly more expressive than Atl*.
...
...