Name
Abstract | ||
|---|---|---|
Two proof systems for the congruences of causal bisimulation and location equivalence of finite CCS are proposed. They generalize the known axiomatizations for restriction free processes which are based on the two merge operators of ACP. Since the proof systems only differ in three equations they provide a simple means of comparison. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/3-540-57182-5_46 | MFCS |
Keywords | Field | DocType |
proof systems | Transition system,Discrete mathematics,Algebra,Computer science,Equivalence (measure theory),Operator (computer programming),Bisimulation,Merge (version control),Congruence relation | Conference |
ISBN | Citations | PageRank |
3-540-57182-5 | 4 | 0.51 |
References | Authors | |
12 | 1 | |