Readies and Failures in the Algebra of Communicating Processes
Readies and Failures in the Algebra of Communicating Processes
复制标题
通信过程代数中的准备和失败
DOI：
10.1137/0217073
复制
发表时间：
1988
期刊：
影响因子：
--
通讯作者：
E. Olderog
中科院分区：
文献类型：
--
作者：
J. Bergstra;J. Klop;E. Olderog
在通信进程代数（ACP）的背景下，研究了准备和故障语义。建立了过程图模准备等价和模失效等价的模型，给出了该模型的完备公理系统。给出了图模型的一种显式表示，即失效模型，其元素是失效集。此外，故障等价的特征是得到了最大的同余，这是符合迹语义。通过适当地限制ACP中的通信格式，这个结果被证明可以延续到Hoare的通信顺序过程（CSP）和米尔纳的通信系统演算（CCS）的子集。此外，表征意味着故障模型的完全抽象结果。在上面我们限制自己有限过程没有$\tau $-步骤。在文件的最后一个评论的情况下，无限过程与$\tau $-步骤：特别是W…
Readiness and failure semantics are studied in the setting of Algebra of Communicating Processes (ACP). A model of process graphs modulo readiness equivalence, respectively, failure equivalence, is constructed, and an equational axiom system is presented which is complete for this graph model. An explicit representation of the graph model is given, the failure model, whose elements are failure sets. Furthermore, a characterisation of failure equivalence is obtained as the maximal congruence which is consistent with trace semantics. By suitably restricting the communication format in ACP, this result is shown to carry over to subsets of Hoare’s Communicating Sequential Processes (CSP) and Milner’s Calculus of Communicating Systems (CCS). Also, the characterisation implies a full abstraction result for the failure model. In the above we restrict ourselves to finite processes without $\tau $-steps. At the end of the paper a comment is made on the situation for infinite processes with $\tau $-steps: notably w...