PRIORITIES IN PROCESS ALGEBRAS

被引:52
作者
CLEAVELAND, R [1 ]
HENNESSY, M [1 ]
机构
[1] UNIV SUSSEX,DEPT COMP SCI,BRIGHTON BN1 9QH,E SUSSEX,ENGLAND
关键词
D O I
10.1016/0890-5401(90)90059-Q
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An operational semantics for an algebraic theory of concurrency that incorporates a notion of priority into the definition of the execution of actions is developed. An equivalence based on strong observational equivalence is defined and shown to be a congruence, and a complete axiomatization is given for finite terms. Several examples higlight the novelty and usefulness of our approach. © 1990.
引用
收藏
页码:58 / 77
页数:20
相关论文
共 15 条
[1]  
BAETEN JCM, 1985, CSR8503 DEP COMP SCI
[2]   A NOTE ON RELIABLE FULL-DUPLEX TRANSMISSION OVER HALF-DUPLEX LINLS [J].
BARTLETT, KA ;
SCANTLEBURY, RA ;
WILKINSON, PT ;
LYNCH, WC .
COMMUNICATIONS OF THE ACM, 1969, 12 (05) :260-+
[3]   PROCESS ALGEBRA FOR SYNCHRONOUS COMMUNICATION [J].
BERGSTRA, JA ;
KLOP, JW .
INFORMATION AND CONTROL, 1984, 60 (1-3) :109-137
[4]  
BRINKSMA E, 1986, P IFIP WORKSH PROT S, V5, P73
[5]   TESTING EQUIVALENCES FOR PROCESSES [J].
DENICOLA, R ;
HENNESSY, MCB .
THEORETICAL COMPUTER SCIENCE, 1984, 34 (1-2) :83-133
[6]  
HAREL D, 1987, SCI COMPUT PROGRAMMI, V8
[7]   ALGEBRAIC LAWS FOR NONDETERMINISM AND CONCURRENCY [J].
HENNESSY, M ;
MILNER, R .
JOURNAL OF THE ACM, 1985, 32 (01) :137-161
[8]  
Hoare C.A.R., 1985, COMMUNICATING SEQUEN
[9]  
KANELLAKIS PC, 1983, 2ND P ANN ACM S PRIN
[10]   CALCULI FOR SYNCHRONY AND ASYNCHRONY [J].
MILNER, R .
THEORETICAL COMPUTER SCIENCE, 1983, 25 (03) :267-310