A uniform reduction equivalence for process calculi | |
Cao, ZN | |
2004 | |
英文摘要 | We present a new uniform definition of reduction-based semantics for different process calculi, called indexed reduction equivalence (or congruence). We prove that early bisimulation coincides with indexed reduction equivalence for pi-calculus, context bisimulation coincides with indexed reduction equivalence for higher order pi-calculus and indexed reduction congruence is strictly finer than contextual barbed congruence for Safe Mobile Ambients.; Computer Science, Software Engineering; Computer Science, Theory & Methods; SCI(E); CPCI-S(ISTP); 2 |
语种 | 英语 |
出处 | SCI |
内容类型 | 其他 |
源URL | [http://hdl.handle.net/20.500.11897/315073] ![]() |
专题 | 数学科学学院 |
推荐引用方式 GB/T 7714 | Cao, ZN. A uniform reduction equivalence for process calculi. 2004-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论