计算机工程与应用2016，Vol.52Issue(17)：41-48,8.DOI:10.3778/j.issn.1002-8331.1410-0203
逻辑LTS预备模拟关系的判定算法
Ready simulation determining algorithm on logic LTS
摘要
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分类
信息技术与安全科学引用本文复制引用
朱文涛..逻辑LTS预备模拟关系的判定算法[J].计算机工程与应用,2016,52(17):41-48,8.基金项目
国家自然科学基金（No.60973045）。 （）
