有限出次方程图双模拟等价的可判定性

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI:10.1109/SFCS.1998.743435

Géraud Sénizergues

{"title":"有限出次方程图双模拟等价的可判定性","authors":"Géraud Sénizergues","doi":"10.1109/SFCS.1998.743435","DOIUrl":null,"url":null,"abstract":"The bisimulation problem for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the /spl eta/-bisimulation problem for deterministic rational (vectors of) Boolean series on the alphabet of a dpda M. We then exhibit a complete formal system for deducing equivalent pairs of such vectors.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"76","resultStr":"{\"title\":\"Decidability of bisimulation equivalence for equational graphs of finite out-degree\",\"authors\":\"Géraud Sénizergues\",\"doi\":\"10.1109/SFCS.1998.743435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The bisimulation problem for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the /spl eta/-bisimulation problem for deterministic rational (vectors of) Boolean series on the alphabet of a dpda M. We then exhibit a complete formal system for deducing equivalent pairs of such vectors.\",\"PeriodicalId\":228145,\"journal\":{\"name\":\"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"76\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1998.743435\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1998.743435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 76

摘要

证明了有限输出次方程图的双模拟问题是可判定的。我们将这个问题简化为dpda m的字母表上布尔级数的确定性有理(向量)的/spl eta/-双模拟问题，然后展示了一个完整的形式系统来推导这些向量的等效对。

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

查看原文本刊更多论文

Decidability of bisimulation equivalence for equational graphs of finite out-degree

The bisimulation problem for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the /spl eta/-bisimulation problem for deterministic rational (vectors of) Boolean series on the alphabet of a dpda M. We then exhibit a complete formal system for deducing equivalent pairs of such vectors.

求助全文

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

来源期刊

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)

自引率

0.00%

发文量