pspace完备中基本并行过程的强双相似性

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI:10.1109/LICS.2003.1210061

P. Jančar

{"title":"pspace完备中基本并行过程的强双相似性","authors":"P. Jančar","doi":"10.1109/LICS.2003.1210061","DOIUrl":null,"url":null,"abstract":"The paper shows an algorithm which, given a basic parallel processes (BPP) system, constructs a set of linear mappings which characterize the (strong) bisimulation equivalence on the system. Though the number of the constructed mappings can be exponential, they can be generated in polynomial space; this shows that the problem of deciding bisimulation equivalence on BPP is in PSAPCE. Combining with the PSPACE-hardness result by Srba, PSPACE-completeness is thus established.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"71","resultStr":"{\"title\":\"Strong bisimilarity on basic parallel processes in PSPACE-complete\",\"authors\":\"P. Jančar\",\"doi\":\"10.1109/LICS.2003.1210061\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper shows an algorithm which, given a basic parallel processes (BPP) system, constructs a set of linear mappings which characterize the (strong) bisimulation equivalence on the system. Though the number of the constructed mappings can be exponential, they can be generated in polynomial space; this shows that the problem of deciding bisimulation equivalence on BPP is in PSAPCE. Combining with the PSPACE-hardness result by Srba, PSPACE-completeness is thus established.\",\"PeriodicalId\":280809,\"journal\":{\"name\":\"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"71\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2003.1210061\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2003.1210061","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 71

摘要

本文给出了一种算法，该算法给定一个基本并行过程(BPP)系统，在该系统上构造一组表征(强)双仿真等价的线性映射。虽然构造映射的数量可以是指数的，但它们可以在多项式空间中生成;这表明在PSAPCE中存在判定BPP上的双模拟等价性的问题。结合Srba的pspace -硬度结果，建立了pspace -完备性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Strong bisimilarity on basic parallel processes in PSPACE-complete

The paper shows an algorithm which, given a basic parallel processes (BPP) system, constructs a set of linear mappings which characterize the (strong) bisimulation equivalence on the system. Though the number of the constructed mappings can be exponential, they can be generated in polynomial space; this shows that the problem of deciding bisimulation equivalence on BPP is in PSAPCE. Combining with the PSPACE-hardness result by Srba, PSPACE-completeness is thus established.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.

自引率

0.00%

发文量