Scholarlink

<p>We present circular assume-guarantee reasoning rules automated by an appropriate use of passive learning algorithms for automata and LTL formulas. Both algorithms directly apply to systems made of not just two but multiple components. Moreover the algorithms are modular in the sense that they can be instantiated by any external learning algorithm and model checker. We present experiments showing the feasability of our approach.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Automatic assume-guarantee reasoning for safety and liveness using passive learning

  • 期刊论文

  • 发表日期：

    2025年7月9日

查看全文
  • Ocan Sankur

摘要

We present circular assume-guarantee reasoning rules automated by an appropriate use of passive learning algorithms for automata and LTL formulas. Both algorithms directly apply to systems made of not just two but multiple components. Moreover the algorithms are modular in the sense that they can be instantiated by any external learning algorithm and model checker. We present experiments showing the feasability of our approach.