45 research outputs found
Model-checking Quantitative Alternating-time Temporal Logic on One-counter Game Models
We consider quantitative extensions of the alternating-time temporal logics
ATL/ATLs called quantitative alternating-time temporal logics (QATL/QATLs) in
which the value of a counter can be compared to constants using equality,
inequality and modulo constraints. We interpret these logics in one-counter
game models which are infinite duration games played on finite control graphs
where each transition can increase or decrease the value of an unbounded
counter. That is, the state-space of these games are, generally, infinite. We
consider the model-checking problem of the logics QATL and QATLs on one-counter
game models with VASS semantics for which we develop algorithms and provide
matching lower bounds. Our algorithms are based on reductions of the
model-checking problems to model-checking games. This approach makes it quite
simple for us to deal with extensions of the logical languages as well as the
infinite state spaces. The framework generalizes on one hand qualitative
problems such as ATL/ATLs model-checking of finite-state systems,
model-checking of the branching-time temporal logics CTL and CTLs on
one-counter processes and the realizability problem of LTL specifications. On
the other hand the model-checking problem for QATL/QATLs generalizes
quantitative problems such as the fixed-initial credit problem for energy games
(in the case of QATL) and energy parity games (in the case of QATLs). Our
results are positive as we show that the generalizations are not too costly
with respect to complexity. As a byproduct we obtain new results on the
complexity of model-checking CTLs in one-counter processes and show that
deciding the winner in one-counter games with LTL objectives is
2ExpSpace-complete.Comment: 22 pages, 12 figure
Multi-Agent Programming Contest 2011 - The Python-DTU Team
We provide a brief description of the Python-DTU system, including the
overall design, the tools and the algorithms that we plan to use in the agent
contest.Comment: 4 page
Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics
We consider several natural fragments of the alternating-time temporal logics ATL* and ATL with restrictions on the nesting between temporal operators and strategic quantifiers. We develop optimal decision procedures for satisfiability in these fragments, showing that they have much lower complexities than the full languages. In particular, we prove that the satisfiability problem for state formulae in the full `strategically flat' fragment of ATL* is PSPACE-complete, whereas the satisfiability problems in the flat fragments of ATL and ATL are
-complete. We note that the nesting hierarchies for fragments of ATL* collapse in terms of expressiveness above nesting depth 1, hence our results cover all such fragments with lower complexities
Multi-Agent Programming Contest 2010 - The Jason-DTU Team
We provide a brief description of the Jason-DTU system, including the
methodology, the tools and the team strategy that we plan to use in the agent
contest.Comment: 4 page
Nash Equilibria in Symmetric Graph Games with Partial Observation
International audienceWe investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. Therefore, this game has partial information and symmetry constraints, which make the computation of Nash equilibria difficult. We show several undecidability results, and for bounded-memory strategies, we precisely characterize the complexity of computing pure Nash equilibria for qualitative objectives in this game model
Multi-Agent Programming Contest 2012 - The Python-DTU Team
We provide a brief description of the Python-DTU system, including the
overall design, the tools and the algorithms that we plan to use in the agent
contest.Comment: 4 pages. arXiv admin note: text overlap with arXiv:1110.010
Alternating-time temporal logic with finite-memory strategies
Model-checking the alternating-time temporal logics ATL and ATL* with
incomplete information is undecidable for perfect recall semantics. However,
when restricting to memoryless strategies the model-checking problem becomes
decidable. In this paper we consider two other types of semantics based on
finite-memory strategies. One where the memory size allowed is bounded and one
where the memory size is unbounded (but must be finite). This is motivated by
the high complexity of model-checking with perfect recall semantics and the
severe limitations of memoryless strategies. We show that both types of
semantics introduced are different from perfect recall and memoryless semantics
and next focus on the decidability and complexity of model-checking in both
complete and incomplete information games for ATL/ATL*. In particular, we show
that the complexity of model-checking with bounded-memory semantics is
Delta_2p-complete for ATL and PSPACE-complete for ATL* in incomplete
information games just as in the memoryless case. We also present a proof that
ATL and ATL* model-checking is undecidable for n >= 3 players with
finite-memory semantics in incomplete information games.Comment: In Proceedings GandALF 2013, arXiv:1307.416