中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
题名:
decidability of weak bisimilarity for a subset of bpa
作者: Chen Haiyan
关键词: Approximation theory ; Computer simulation ; Trees (mathematics) ; Verification
刊名: Electronic Notes in Theoretical Computer Science
发表日期: 2008
卷: 212, 期:C, 页:241-255
收录类别: ei,acm,sciencedirect
部门归属: (1) State Key Laboratory Computer Science, Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, 100080 Beijing, China
语种: 英语
内容类型: 期刊论文
URI标识: http://ir.iscas.ac.cn/handle/311060/10299
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
decidability of weak bisimilarity for a subset of bpa.pdf(306KB)----限制开放-- 联系获取全文

Recommended Citation:
Chen Haiyan. decidability of weak bisimilarity for a subset of bpa[J]. Electronic Notes in Theoretical Computer Science,2008-01-01,212(C):241-255.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Chen Haiyan]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Chen Haiyan]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace