资源分类
》 资源 》论文》Verifying Emergence of Bounded Time Properties in Probabilistic Swarm Systems

Verifying Emergence of Bounded Time Properties in Probabilistic Swarm Systems

2019-11-05 | |  66 |   40 |   0
Abstract We introduce a parameterised semantics for reasoning about swarms as unbounded collections of agents in a probabilistic setting. We develop a method for the formal identification of emergent properties, expressed in a fragment of the probabilistic logic PCTL. We introduce algorithms for solving the related decision problems and show their correctness. We present an implementation and evaluate its performance on an ant coverage algorithm.

上一篇：What Game Are We Playing? End-to-end Learning in Normal and Extensive Form Games

下一篇：Maximin Share Allocations on Cycles

用户评价
全部评价

热门资源

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