TURNING SOS RULES INTO EQUATIONS

被引：67

作者：

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 条

[41] MOLLER F, 1989, CST5989 U ED DEP COM
[42] AXIOMATIC PROOF TECHNIQUE FOR PARALLEL PROGRAMS .1.
OWICKI, S
GRIES, D
[J]. ACTA INFORMATICA, 1976, 6 (04) : 319 - 340
[43] Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI
[44] Park D., 1981, LECT NOTES COMPUT SC, V104, P167, DOI DOI 10.1007/BFB0017309
[45] PATERSON M, 1990, LECTURE NTOES COMPUT, V443
[46] Plotkin, 1981, DAIMIFN19 AARH U COM
[47] PLOTKIN GD, 1983, FORMAL DESCRIPTION P, V2, P199
[48] SADE, 1984, DIAMOND LIFE
[49] SCHNEIDERFB, 1991, LECTURE NOTES COMPUT, P618
[50] A GENERALIZATION OF OWICKI-GRIES HOARE LOGIC FOR A CONCURRENT WHILE LANGUAGE
STIRLING, C
[J]. THEORETICAL COMPUTER SCIENCE, 1988, 58 (1-3) : 347 - 359

← 1 2 3 4 5 6 →