ANNALS OF PURE AND APPLIED LOGIC
ANNALS OF PURE AND APPLIED LOGIC
复制标题
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
中科院分区：
文献类型：
--
作者：
定义了一种新的过程逻辑，称为计算路径逻辑（CPL）。它本质上同样地对待LBNN~~LA~和程序。CPL是PDL的路径扩展。遵循Harel的基本pt-ocess逻辑。科曾和帕里克并且在精神上接近于Hare 1和Peleg的逻辑R。它具有以前过程逻辑的大部分优点。但在基本TLMC中是可判定的。我们还对异步并发和无限计算的建模进行了扩展。所有的扩展也被证明是可判定的基本时间。：g 1999 Elsevicr Scicncr B. V.保留所有权利。K<S~~l~，ort/.s：过程逻辑：动态逻辑：时态逻辑：计算路径
A new process logic is defined, called computation paths logic (CPL). which treats lbnn~~la~ and programs essentially alike. CPL is a pathwlse extension of PDL. following the basic pt-ocess logic of Harel. Kozen and Parikh. and is close in spirit to the logic R of Hare1 and Peleg. It enjoys most of the advantages of previous process logics. yet is decidable in elementary tlmc. We also ofrcr extensions for modeling asynchronouaisynchronous concurrency and infinite computanons. All extensions are also shown to be decidable in elementary time. :g 1999 Elsevicr Scicncr B.V. All rights reserved. K<S~~l~,ort/.s: Process logic: Dynamic logic: Temporal logic: Computation paths