TURNING SOS RULES INTO EQUATIONS

被引：68
作者：
ACETO, L
BLOOM, B
VAANDRAGER, F
机构：
[1] CORNELL UNIV, DEPT COMP SCI, ITHACA, NY 14853 USA
[2] CWI, DEPT SOFTWARE TECHNOL, 1009 AB AMSTERDAM, NETHERLANDS
[3] UNIV AMSTERDAM, PROGRAMMING RES GRP, 1098 SJ AMSTERDAM, NETHERLANDS
来源：
INFORMATION AND COMPUTATION | 1994年 / 111卷 / 01期
关键词：
D O I：
10.1006/inco.1994.1040
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of Bloom et al. (J. Assoc. Comput. Mach., to appear). We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes. (C) 1994 Academic Press, Inc.
引用
收藏
页码：1 / 52
页数：52
相关论文
共 57 条
[1]  
ACETO L, 1993, IR932009 AALB U I EL
[2]  
ACETO L, 1992, CSR9218 CWI REP
[3]  
AMERICA P, 1986, 13TH S PRINC PROGR L, P194
[4]  
ASTESIANO E, 1986, ADA MANAGING TRANSIT
[5]   ALGEBRA OF PROCESSES AND SYNCHRONIZATION [J].
AUSTRY, D ;
BOUDOL, G .
THEORETICAL COMPUTER SCIENCE, 1984, 30 (01) :91-131
[6]  
Baeten J. C. M., 1986, Fundamenta Informaticae, V9, P127
[7]  
Baeten J. C. M., 1990, CAMBRIDGE TRACTS THE, V18
[8]   AN ALGEBRA FOR PROCESS CREATION [J].
BAETEN, JCM ;
VAANDRAGER, FW .
ACTA INFORMATICA, 1992, 29 (04) :303-334
[9]  
BAETEN JCM, 1991, P9111 U AM REP
[10]  
BAETEN JCM, 1990, LECTURE NOTES COMPUT, V458
123456