TOWARDS ACTION-REFINEMENT IN PROCESS ALGEBRAS

被引:38
作者
ACETO, L
HENNESSY, M
机构
[1] School of Cognitive and Computing Sciences, University of Sussex
关键词
D O I
10.1006/inco.1993.1019
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a simple process algebra which supports a form of refinement of an action by a process and address the question of an appropriate equivalence relation for it. The main result of the paper is that an adequate equivalence can be defined in a very intuitive manner. In fact we show that it coincides with the timed-equivalence proposed by one of the authors. We also show that it can be characterized equationally. © 1993 Academic Press, Inc.
引用
收藏
页码:204 / 269
页数:66
相关论文
共 37 条
[1]   OBSERVATION EQUIVALENCE AS A TESTING EQUIVALENCE [J].
ABRAMSKY, S .
THEORETICAL COMPUTER SCIENCE, 1987, 53 (2-3) :225-241
[2]  
ACETO L, 1990, IN PRESS INFORMATION
[3]   PROCESS ALGEBRA FOR SYNCHRONOUS COMMUNICATION [J].
BERGSTRA, JA ;
KLOP, JW .
INFORMATION AND CONTROL, 1984, 60 (1-3) :109-137
[4]   PROCESS THEORY BASED ON BISIMULATION SEMANTICS [J].
BERGSTRA, JA ;
KLOP, JW .
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 354 :50-122
[5]   ALGEBRA OF COMMUNICATING PROCESSES WITH ABSTRACTION [J].
BERGSTRA, JA ;
KLOP, JW .
THEORETICAL COMPUTER SCIENCE, 1985, 37 (01) :77-121
[6]   CONCURRENCY AND ATOMICITY [J].
BOUDOL, G ;
CASTELLANI, I .
THEORETICAL COMPUTER SCIENCE, 1988, 59 (1-2) :25-84
[7]   A THEORY OF COMMUNICATING SEQUENTIAL PROCESSES [J].
BROOKES, SD ;
HOARE, CAR ;
ROSCOE, AW .
JOURNAL OF THE ACM, 1984, 31 (03) :560-599
[8]   DISTRIBUTED BISIMULATIONS [J].
CASTELLANI, I ;
HENNESSY, M .
JOURNAL OF THE ACM, 1989, 36 (04) :887-911
[9]  
CASTELLANO L, 1987, EATCS B, V31, P12
[10]  
DARONDEAU P, 1989, LECT NOTES COMPUT SC, V372, P234