Name
Abstract | ||
|---|---|---|
We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution. Then we extend this equivalence to the specification language $\mu$CRL. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0020-0190(01)00218-6 | Inf. Process. Lett. |
Keywords | Field | DocType |
process algebra,recursive specification,equivalence relation,explicit notion,specification language,µcrl,equivalence of recursive specifications | Quotient algebra,Logical equivalence,Equivalence relation,Equivalence partitioning,Matrix equivalence,Algebra,Equivalence (measure theory),Congruence relation,Mathematics,Adequate equivalence relation | Journal |
Volume | Issue | ISSN |
80 | 1 | 0020-0190 |
Citations | PageRank | References |
1 | 0.36 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alban Ponse | 1 | 404 | 38.05 |
| Yaroslav S. Usenko | 2 | 125 | 10.75 |