ISCAS OpenIR
decidability of weak bisimilarity for a subset of bpa
Chen Haiyan
2008
SourceElectronic Notes in Theoretical Computer Science
ISSN15710661
Volume212Issue:CPages:241-255
Indexed Typeei,acm,sciencedirect
KeywordApproximation Theory Computer Simulation Trees (Mathematics) Verification
Department(1) State Key Laboratory Computer Science, Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, 100080 Beijing, China
Language英语
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/10299
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Chen Haiyan. decidability of weak bisimilarity for a subset of bpa[J]. Electronic Notes in Theoretical Computer Science,2008,212(C):241-255.
APA Chen Haiyan.(2008).decidability of weak bisimilarity for a subset of bpa.Electronic Notes in Theoretical Computer Science,212(C),241-255.
MLA Chen Haiyan."decidability of weak bisimilarity for a subset of bpa".Electronic Notes in Theoretical Computer Science 212.C(2008):241-255.
Files in This Item:
File Name/Size DocType Version Access License
decidability of weak(306KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Chen Haiyan]'s Articles
Baidu academic
Similar articles in Baidu academic
[Chen Haiyan]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chen Haiyan]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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