First-Order Linear Temporal Logic ($\mathrm{\text{FOLTL}}$) and its Many-Sorted variant (MSFOLTL) are well-suited to specify infinite-state systems. However, the satisfiability of (MS)$\mathrm{\text{FOLTL}}$ is not even semi-decidable, thus preventing automated verification. In this paper, we exhibit various fragments of increasing scope that provide a pertinent basis for the abstract specification of infinite-state systems. We show that these fragments enjoy the Bounded Domain Property (any satisfiable (MS)$\mathrm{\text{FOLTL}}$ formula has a model with a finite, bounded FO domains), which provides a basis for complete, automated verification by reduction to LTL satisfiability. Finally, we present a simple case study illustrating the applicability and limitations of our results.

一阶线性时序逻辑 ($\mathrm{\text{福尔特}}$) 及其多排序变体 (MSFOLTL) 非常适合指定无限状态系统。然而，(MS) 的可满足性$\mathrm{\text{福尔特}}$甚至不是半可判定的，从而阻止了自动验证。在本文中，我们展示了范围不断扩大的各种片段，这些片段为无限状态系统的抽象规范提供了相关基础。我们证明这些片段享有有界域属性（任何可满足（MS）$\mathrm{\text{福尔特}}$公式具有一个具有有限、有界FO 域的模型），它通过减少 LTL 可满足性为完整的自动验证提供了基础。最后，我们提出了一个简单的案例研究，说明了我们结果的适用性和局限性。