资源分类
》 资源 》论文》Pushdown Multi-Agent System Verification

Pushdown Multi-Agent System Verification

2019-11-18 | |  76 |   43 |   0

Abstract

In  this  paper  we  investigate  the  model-checking problem  of  pushdown  multi-agent  systems  for ATL specifications.   To  this  aim,  we  introduce pushdown game structures over which ATL for-mulas are interpreted.  We show an algorithm that solves the addressed model-checking problem in 3EXP TIME. We also provide a 2E XP S PACE lower bound by showing a reduction from the word ac-ceptance problem for deterministic Turing machines with doubly exponential space


上一篇：Verifying Emergent Properties of Swarms

下一篇：A Scalable Interdependent Multi-Issue Negotiation Protocol for Energy Exchange

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...