AN EFFICIENCY PREORDER FOR PROCESSES

被引：71

作者：

ARUNKUMAR, S ^{[1
]}

HENNESSY, M ^{[1
]}

机构：

[1] UNIV SUSSEX,SCH COGNIT & COMP SCI,BRIGHTON BN1 9QH,E SUSSEX,ENGLAND

来源：

ACTA INFORMATICA | 1992年 / 29卷 / 08期

关键词：

D O I：

10.1007/BF01191894

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A simple efficiency preorder for CCS processes is introduced in which p less-than-or-similar-to q means that q is at least as fast as p, or more generally, p uses at least as much resources as q. It is shown to be preserved by all CCS contexts except summation and it is used to analyse a non-trivial example: two different implementations of a bounded buffer. Finally we give a sound and complete proof system for finite processes.

引用

页码：737 / 760

页数：24

共 15 条

[1]

ARUNKUMAR S, 1991, LECT NOTES COMPUT SC, V526, P152

[2]

BEATON J, 1989, REAL TIME PROCESS AL

[3]

CLEAVELAND R, 1989, ECSLFCS8983 U ED TEC

[4]

DAVIES J, 1989, INTRO TIMED CSP

[5]

GERT R, 1986, LECTURE NOTES COMPUT, V267, P95

[6] ALGEBRAIC LAWS FOR NONDETERMINISM AND CONCURRENCY [J].

HENNESSY, M ;

MILNER, R .

JOURNAL OF THE ACM, 1985, 32 (01) :137-161

[7]

Hennessy M., 1988, ALGEBRAIC THEORY PRO

[8]

HENNESSY M, 1990, 290 U SUSS TECHN REP

[9]

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

[10]

Milner R., 1989, Communication and concurrency

← 1 2 →