A THEORY OF COMMUNICATING PROCESSES WITH VALUE PASSING

被引：31

作者：

HENNESSY, M

INGOLFSDOTTIR, A

机构：

[1] School of Cognitive and Computing Sciences, University of Sussex, Brighton

来源：

INFORMATION AND COMPUTATION | 1993年 / 107卷 / 02期

关键词：

D O I：

10.1006/inco.1993.1067

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A semantic theory of process algebras which allows processes to communicate values is described. A behavioural theory of testing is given for such processes and is modelled by an extension of Acceptance Trees. A proof system is also given for this model and is shown to be both sound and complete. Finally, the model is shown to be fully abstract with respect to the behavioural theory. © 1993 Academic Press, Inc.

引用

页码：202 / 236

页数：35

共 19 条

[1]

BRINKSMA E, 1986, P IFIP WORKSHOP PROT, P73

[2] TESTING EQUIVALENCES FOR PROCESSES [J].

DENICOLA, R ;

HENNESSY, MCB .

THEORETICAL COMPUTER SCIENCE, 1984, 34 (1-2) :83-133

[3]

GUESSARIAN I, 1981, LECTURE NOTES COMPUT, V99

[4] ACCEPTANCE TREES [J].

HENNESSY, M .

JOURNAL OF THE ACM, 1985, 32 (04) :896-928

[5] AN ALGEBRAIC-THEORY OF FAIR ASYNCHRONOUS COMMUNICATING PROCESSES [J].

HENNESSY, M .

THEORETICAL COMPUTER SCIENCE, 1987, 49 (2-3) :121-143

[6]

Hennessy M., 1988, ALGEBRAIC THEORY PRO

[7]

HENNESSY M, 1989, LECT NOTES COMPUT SC, V405, P325

[8]

HENNESSY M, 1980, LECTURE NOTES COMPUT, V88

[9]

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

[10]

HOARE CAR, 1988, THEORETICAL COMPUTER, V60, P177

← 1 2 →