资源分类
》 资源 》论文》Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications

Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications

2019-10-10 | |  74 |   49 |   0
Abstract Epistemic Halpern-Shoham logic (EHS) is an interval temporal logic defined to verify properties of Multi-Agent Systems. In this paper we show that model checking Multi-Agent Systems with regular expressions against EHS specifications is decidable. We achieve this by reducing the model checking problem to the satisfiability problem of Monadic Second-Order Logic on trees

上一篇：DANE: Domain Adaptive Network Embedding

下一篇：Difficulty Controllable Generation of Reading Comprehension Questions

用户评价
全部评价

热门资源

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