CCS with priority guards
CCS with priority guards
复制标题
带优先级保护的 CCS
DOI：
10.1016/j.jlap.2007.06.005
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
I. Phillips
中科院分区：
文献类型：
--
作者：
I. Phillips
人们早就认识到，标准进程代数难以处理不同优先级的动作，例如高优先级的中断动作。人们提出了各种解决方案。我们引入了一种新的方法，将“优先级保护”添加到米尔纳的过程演算CCS中。在我们的方法中，优先级是非分层的，这意味着操作没有被分配固定的级别，因此相同的操作可以根据它出现在程序中的位置而具有不同的优先级。与CCS中其他未分层的优先级描述（如Camilleri和Winskel）不同，我们对称地对待投入和产出。我们介绍了新的微积分，给出了例子，发展了它的理论（包括双模拟和等式定律），并与现有的方法进行了比较。我们用leader选举问题说明了优先级给CCS和π微积分都增加了表达性。
It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of “priority guards” to Milner’s process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assigned fixed levels, so that the same action can have different priority depending where it appears in a program. Unlike in other unstratified accounts of priority in CCS (such as that of Camilleri and Winskel), we treat inputs and outputs symmetrically. We introduce the new calculus, give examples, develop its theory (including bisimulation and equational laws), and compare it with existing approaches. We use leader election problems to show that priority adds expressiveness to both CCS and the π-calculus.
DOI：
--
发表时间：
2021
期刊：
--
影响因子：
--
作者：
通讯作者：
--