SEMANTICS OF FINITE AND INFINITE NETWORKS OF CONCURRENT COMMUNICATING AGENTS

被引：16

作者：

BROY, M ^{[1
]}

机构：

[1] UNIV PASSAU,FAK MATH & INFORMAT,D-8390 PASSAU,FED REP GER

来源：

关键词：

D O I：

10.1007/BF01786252

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

COMPUTER PROGRAMMING

引用

页码：13 / 31

页数：19

共 24 条

[1]

ARNOLD A, 1979, LITP7935 U PAR REP

[2]

BACK RJR, 1982, ACM PRINCIPLES DISTR, P111

BACKUS, J .

[4]

BEKIC H, 1982, UNPUB NONDETERMINIST

[5]

BOUSSINOT F, 1981, THESIS U PARIS 7

[6]

BROCK JD, 1981, LECT NOTES COMPUT SC, V107, P252

[7]

Broy M., 1982, Theoretical Foundations of Programming Methodology. Lecture Notes of an International Summer School, P565

BROY, M .

[9] PARTIAL ABSTRACT TYPES [J].

BROY, M ;

WIRSING, M .

[10]

BROY M, 1983, 1983 IFIP WORLD C, P259