资源分类
》 资源 》论文》The Complexity of Model Checking Succinct Multiagent Systems

The Complexity of Model Checking Succinct Multiagent Systems

2019-11-18 | |  72 |   42 |   0

Abstract This paper studies the complexity of model checking multiagent systems, in particular systems succinctly described by two practical representations: concurrent representation and symbolic representation. The logics we concern include branching time temporal logics and several variants of alternating time temporal logics.

上一篇：Symbolic Model Checking for One-Resource RB±ATL†

下一篇：Verifying Emergent Properties of Swarms

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...