资源分类
》 资源 》论文》Finite Abstractions for the Verification of Epistemic Properties in Open Multi-Agent Systems

Finite Abstractions for the Verification of Epistemic Properties in Open Multi-Agent Systems

2019-11-18 | |  82 |   59 |   0
Abstract We develop a methodology to model and verify open multi-agent systems (OMAS), where agents may join in or leave at run time. Further, we specify properties of interest on OMAS in a variant of firstorder temporal-epistemic logic, whose characterising features include epistemic modalities indexed to individual terms, interpreted on agents appearing at a given state. This formalism notably allows to express group knowledge dynamically. We study the verification problem of these systems and show that, under specific conditions, finite bisimilar abstractions can be obtained.

上一篇：Building Hierarchies of Concepts via Crowdsourcing

下一篇：Formal Analysis of Dialogues on Infinite Argumentation Frameworks

用户评价
全部评价

热门资源

  • 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 ...

  • Learning to learn...

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

  • A Mathematical Mo...

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