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 条
[11]  
MILNER R, 1980, LECTURE NOTES COMPUT, V92
[12]   3 PARTITION REFINEMENT ALGORITHMS [J].
PAIGE, R ;
TARJAN, RE .
SIAM JOURNAL ON COMPUTING, 1987, 16 (06) :973-989
[13]  
PNUELI A, 1985, LNCS, V194, P14
[14]  
1984, OCCAM PROGRAMMING MA
[15]  
[No title captured]