Abstract

This article revises the results of work devoted to representing the behavior of a program system as a set of formulae of linear temporal logic (LTL), followed by the use of this representation to verify the satisfiability of the program properties of the system by proving the validity of logical inferences expressed in terms of the LTL. This logic is applied to bounded Minsky counter machines considered as program systems whose behavior must be specified. Earlier on, a special pseudooperator was introduced for referring to previous values of variables used in elementary propositions when working with the LTL temporal logic as a program logic. Even though this pseudooperator is easy to implement in the Cadence SMV verifier when proving the validity of logical LTL inferences, the classical definition of the LTL does not imply its presence. This article will use only binary variables to build the LTL specification for the behavior of a bounded counter machine. Previous values of these variables will be tracked through the appropriate formulas exclusively within the LTL itself.

中文翻译：

---

有界计数器机的线性时态逻辑规范

摘要

本文修改了致力于将程序系统的行为表示为一组线性时序逻辑 (LTL) 公式的工作成果，然后使用该表示法通过证明以下内容来验证系统的程序属性的可满足性：以 LTL 表达的逻辑推论的有效性。该逻辑应用于被视为必须指定其行为的程序系统的有界明斯基计数器机。早些时候，引入了一个特殊的伪运算符，用于在将 LTL 时态逻辑用作程序逻辑时引用基本命题中使用的变量的先前值。尽管在证明逻辑 LTL 推理的有效性时，这个伪运算符很容易在 Cadence SMV 验证器中实现，但 LTL 的经典定义并不意味着它的存在。本文将仅使用二进制变量来构建有界计数器机器行为的 LTL 规范。这些变量的先前值将通过 LTL 本身内的适当公式进行跟踪。