CAUSAL AUTOMATA

被引：19

作者：

GUNAWARDENA, J ^{[1
]}

机构：

[1] HEWLETT PACKARD CO, BRISTOL BS12 6QZ, ENGLAND

来源：

THEORETICAL COMPUTER SCIENCE | 1992年 / 101卷 / 02期

关键词：

D O I：

10.1016/0304-3975(92)90052-H

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We introduce causal automata, a formalism based on a syntactic approach to causality in contrast to conventional approaches based on partial orders. Our main result is the following characterisation of Milner's notion of confluence in CCS: Confluence = Determinism + {AND, OR} Causality.

引用

页码：265 / 288

页数：24

共 26 条

[11] CONFLUENT REDUCTIONS - ABSTRACT PROPERTIES AND APPLICATIONS TO TERM REWRITING SYSTEMS [J].