The Expressiveness of CSP With Priority
The Expressiveness of CSP With Priority
复制标题
优先CSP的表现力
DOI：
10.1016/j.entcs.2015.12.023
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
A. W. Roscoe
中科院分区：
文献类型：
--
作者：
A. W. Roscoe
作者之前[A.W. Roscoe，关于 CSP 的表现力，https://www.cs.ox.ac.uk/files/1383/expressive.pdf，2011； A.W. Roscoe，理解并发系统，Springer 2010]定义了类似 CSP 的操作语义，其主要限制是大多数τ动作的自动提升、运行进程的无克隆以及操作语义规则中没有否定前提。他表明，每个具有这种操作语义的运算符都可以转换为 CSP，因此在每个 CSP 模型中都具有语义。在本文中，我们证明了类似的结果适用于由 [A.W. Roscoe，理解并发系统，Springer 2010]，删除了对否定前提的限制。
The author previously [A.W. Roscoe,On the expressiveness of CSP, https://www.cs.ox.ac.uk/files/1383/expressive.pdf, 2011; A.W. Roscoe,Understanding concurrent systems, Springer 2010] definedCSP-likeoperational semantics whose main restrictions were the automatic promotion of mostτactions, no cloning of running processes, and no negative premises in operational semantic rules. He showed that every operator with such an operational semantics can be translated into CSP and therefore has a semantics in every model of CSP. In this paper we demonstrate that a similar result holds for CSP extended by the priority operator described in Chapter 20 of [A.W. Roscoe,Understanding concurrent systems, Springer 2010], with the restriction on negative premises removed.