We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values, which have been studied before. We shall use previous results to prove that the satisfiability problem for this logic is decidable. Further, we shall see that trying to extend this logic by making it more expressive can lead to undecidability.
翻译:我们认为线性时间逻辑(LTL)是线性时间时间逻辑(LTL)的延伸,对本地和偏远地区的数据限制都进行了具体领域的解释。这一延伸是限制LTL和重复值时间逻辑的自然延伸,以前已经研究过。我们将利用以前的结果来证明这一逻辑的可反驳性问题是可变的。此外,我们将看到,试图通过使其更清晰地表达来扩展这一逻辑可能会导致不可变。