Abstract: Process algebras and temporal logics are two most widely used specification systems in concurrency theory. Recently, Gerald Luttgen et al combined both to propose the notion of Logic Labeled Transition System（LLTS） and corres-ponding refinement relation：LLTS ready simulation. It introduces an equivalent definition of the LLTS ready simulation：generalized ready simulation, and gives the notion of stable partition pair which is corresponded to this new definition in viewing of partition pair. Based on this notion, it proposes an algorithm to determine whether there exists a LLTS ready simulation between two LLTS, then proves the correctness of the algorithm.

Key words: logic Labeled Transition System（LTS）, ready simulation, partition pair, stability, determining algorithm

摘要： 进程代数与时序逻辑是并发理论中应用最为广泛的两大规范系统。近来，Gerald Luttgen等人将二者进行结合，提出了逻辑标记转换系统以及相应的精化关系——LLTS预备模拟。提出了一种LLTS预备模拟关系的等价描述方式——泛化预备模拟，并从划分对的角度出发，给出与该描述等价的稳定划分对概念。基于这一概念给出一种判定两个逻辑标记转换系统之间是否具有LLTS预备模拟关系的理论算法，并证明其正确性。

关键词: 逻辑标记转换系统, 预备模拟, 划分对, 稳定性, 判定算法