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 条

[1]

ACETO L, 1987, LECT NOTES COMPUT SC, V280, P1

[2]

[Anonymous], 1989, LECT NOTES COMPUT SC

[3]

BOUDOL G, 1988, INRIA798 RES REP

[4] EVENT STRUCTURES AND DOMAINS [J].

DROSTE, M .

THEORETICAL COMPUTER SCIENCE, 1989, 68 (01) :37-47

[5]

GUNAWARDENA J, 1991, LECT NOTES COMPUT SC, V527, P266

[6]

GUNAWARDENA J, 1989, LECT NOTES COMPUT SC, V405, P161

[7]

GUNAWARDENA J, 1989, HPL89002 HEWL PACK L

[8]

GUNAWARDENA J, 1989, HPL89077 HEWL PACK L

[9]

Harel D., 1985, LOGICS MODELS CONCUR, P477, DOI 10.1007/978-3-642-82453-1_17

[10]

Hoare C.A.R., 1985, COMMUNICATING SEQUEN

← 1 2 3 →