ON REDUCTION-BASED PROCESS SEMANTICS

被引:163
作者
HONDA, K [1 ]
YOSHIDA, N [1 ]
机构
[1] KEIO UNIV, DEPT COMP SCI, KOHOKU KU, YOKOHAMA, KANAGAWA 223, JAPAN
基金
日本学术振兴会;
关键词
D O I
10.1016/0304-3975(95)00074-7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A formulation of semantic theories for processes which does not rely on the notion of observables or convergence is studied. The new construction is based solely on a reduction relation and equational reasoning, but can induce meaningful theories for processes, both in weak and strong settings. The resulting theories in many cases coincide with, and sometimes generalise, observation-based formulation of behavioural equivalence. The basic construction of reduction-based theories is studied, taking a simple name passing calculus (called nu-calculus) and its extensions as an example. Results concerning the application of our construction to other calculi are also briefly discussed.
引用
收藏
页码:437 / 486
页数:50
相关论文
共 26 条
[1]  
Abramsky S, 1990, RES TOPICS FUNCTIONA, P65
[2]  
BARENDREGT HP, 1984, LAMBDA CALCULUS
[3]   THE CHEMICAL ABSTRACT MACHINE [J].
BERRY, G ;
BOUDOL, G .
THEORETICAL COMPUTER SCIENCE, 1992, 96 (01) :217-248
[4]  
BOUDOL G, 1991, ASYNCHRONY PI CALCUL
[5]   TESTING EQUIVALENCES FOR PROCESSES [J].
DENICOLA, R ;
HENNESSY, MCB .
THEORETICAL COMPUTER SCIENCE, 1984, 34 (1-2) :83-133
[6]  
ENGBERG U, 1986, DAIMI PB208 U AARH R
[7]  
HONDA K, 1991, LECT NOTES COMPUT SC, V512, P133
[8]  
HONDA K, 1994, 21ST P ANN S PRINC P, P348
[9]  
HONDA K, 1994, LECTURE NOTES COMPUT, V789, P86
[10]  
HONDA K, 1994, THESIS KEIO U