ORDINAL PROCESSES IN COMPARATIVE CONCURRENCY SEMANTICS

被引:0
作者
PINCHINAT, S [1 ]
机构
[1] INST IMAG, INFORMAT FONDAMENTALE & INTELLIGENCE ARTIFICIELLE, CNRS, GRENOBLE, FRANCE
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
When comparing concurrency semantics, one of the main difficulties is to find counter-examples to show that two equivalences do not coincide, which takes on considerable proportions if these equivalences coincide in the framework of finitely branching programs. The study of Ordinal Processes of Klop provides us with a wide family of simple counter-examples. The considered semantics are induced by temporal logics CTL, CTL* and L(mu). We pursue this approach by, in addition, considering CCS-like contexts built up from the tyft operators of Groote and Vaandrager.
引用
收藏
页码:293 / 305
页数:13
相关论文
共 19 条
[1]   ON THE CONSISTENCY OF KOOMEN FAIR ABSTRACTION RULE [J].
BAETEN, JCM ;
BERGSTRA, JA ;
KLOP, JW .
THEORETICAL COMPUTER SCIENCE, 1987, 51 (1-2) :129-176
[2]  
BROOKES SD, 1983, LECT NOTES COMPUT SC, V154, P97
[3]  
Clarke E.M., 1982, LECTURE NOTES COMPUT, V131, P52, DOI DOI 10.1007/BFB0025774
[4]  
DAM M, 1990, ECSLFCS90123 LAB F C
[5]   SOMETIMES AND NOT NEVER REVISITED - ON BRANCHING VERSUS LINEAR TIME TEMPORAL LOGIC [J].
EMERSON, EA ;
HALPERN, JY .
JOURNAL OF THE ACM, 1986, 33 (01) :151-178
[6]  
EMERSON EA, 1980, LECT NOTES COMPUT SC, V85, P169
[7]  
GROOTE JF, 1988, CSR8845 CWI RES REP
[8]   ALGEBRAIC LAWS FOR NONDETERMINISM AND CONCURRENCY [J].
HENNESSY, M ;
MILNER, R .
JOURNAL OF THE ACM, 1985, 32 (01) :137-161
[9]  
HERWIG B, 1989, THESIS A LUDWIGS U F
[10]  
HERWIG B, 1987, 5TH P EAST C MOD THE, P46