资源论文Symbolic Synthesis of Fault-Tolerance Ratios in Parameterised Multi-Agent Systems

Symbolic Synthesis of Fault-Tolerance Ratios in Parameterised Multi-Agent Systems

2019-11-05 | |  66 |   43 |   0
Abstract We study the problem of determining the robustness of a multi-agent system of unbounded size against specifications expressed in a temporalepistemic logic. We introduce a procedure to synthesise automatically the maximal ratio of faulty agents that may be present at runtime for a specification to be satisfied in a multi-agent system. We show the procedure to be sound and amenable to symbolic implementation. We present an implementation and report the experimental results obtained on a number of protocols from swarm robotics.

上一篇:Computational Social Choice Meets Databases

下一篇:Explaining Multi-Criteria Decision Aiding Models with an Extended Shapley Value

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...