Model checking timed recursive CTL

IF 0.8 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 2024-04-09 DOI:10.1016/j.ic.2024.105168

Florian Bruse, Martin Lange

引用次数: 0

Abstract

We introduce Timed Recursive CTL, a merger of two extensions of the well-known branching-time logic CTL: Timed CTL is interpreted over real-time systems like timed automata; Recursive CTL introduces a powerful recursion operator which takes the expressiveness of this logic CTL well beyond that of regular properties. The result is an expressive logic for real-time properties. We show that its model checking problem is decidable over timed automata, namely 2-EXPTIME-complete.

查看原文本刊更多论文

模型检查定时递归 CTL

我们介绍了定时递归 CTL，它是著名的分支时间逻辑 CTL 的两个扩展的合并：定时 CTL 可在实时系统（如定时自动机）上解释；递归 CTL 引入了一个强大的递归算子，使该逻辑 CTL 的表现力远远超出了常规属性的表现力。这就是一种用于实时属性的表现力逻辑。我们证明，它的模型检查问题在定时自动机上是可解的，即 2-EXPTIME-complete。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information and Computation 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking