Rewriting logic and its implementation Maude are a natural and expressive framework for the specification of concurrent systems and logics. Its nondeterministic local transformations are described by rewriting rules, which can be controlled at a higher level using a builtin strategy language added to Maude 3. This specification resource would not be of much interest without tools to analyze their models, so in a previous work, we extended the Maude LTL model checker to verify strategy-controlled systems. In this paper, CTL* and μ-calculus are added to the repertoire of supported logics, after discussing which adaptations are needed for branching-time properties. The new extension relies on some external model checkers that are exposed the Maude models through general and efficient connections, profitable for future extensions and further applications. The performance of these model checkers is compared.

重写逻辑及其实现 Maude 是用于规范并发系统和逻辑的自然而富有表现力的框架。它的非确定性局部转换是通过重写规则来描述的，可以使用添加到 Maude 3 的内置策略语言在更高级别进行控制。 如果没有工具来分析其模型，该规范资源将不会引起太大兴趣，因此在以前的工作中，我们扩展了 Maude LTL 模型检查器来验证策略控制系统。在本文中，CTL* 和μ在讨论了分支时间属性需要哪些调整后，将 -calculus 添加到支持的逻辑库中。新的扩展依赖于一些外部模型检查器，这些检查器通过通用和高效的连接暴露了 Maude 模型，为未来的扩展和进一步的应用提供了利润。比较了这些模型检查器的性能。