一种检验自由选择信号转换图一致性的多项式时间算法

Third International Conference on Application of Concurrency to System Design, 2003. Proceedings. Pub Date : 2003-06-18 DOI:10.1109/CSD.2003.1207700

J. Esparza

{"title":"一种检验自由选择信号转换图一致性的多项式时间算法","authors":"J. Esparza","doi":"10.1109/CSD.2003.1207700","DOIUrl":null,"url":null,"abstract":"Signal transition graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent and complete binary encoding. Checking this is EXPSPACE-hard for arbitrary STGs, and so a lot of attention has been devoted to the subclass of free-choice STGs, which offers a good compromise between expressive power and analyzability. In the last years, polynomial time synthesis techniques have been developed for free-choice STGs, but they assume that the STG has a consistent binary encoding. The first polynomial algorithm for checking consistency is presented here.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"134 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A polynomial-time algorithm for checking consistency of free-choice signal transition graphs\",\"authors\":\"J. Esparza\",\"doi\":\"10.1109/CSD.2003.1207700\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Signal transition graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent and complete binary encoding. Checking this is EXPSPACE-hard for arbitrary STGs, and so a lot of attention has been devoted to the subclass of free-choice STGs, which offers a good compromise between expressive power and analyzability. In the last years, polynomial time synthesis techniques have been developed for free-choice STGs, but they assume that the STG has a consistent binary encoding. The first polynomial algorithm for checking consistency is presented here.\",\"PeriodicalId\":228530,\"journal\":{\"name\":\"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.\",\"volume\":\"134 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSD.2003.1207700\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSD.2003.1207700","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

信号转换图(stg)是异步电路规范中最流行的模型之一。如果STG允许所谓的一致和完整的二进制编码，则可以实现STG。对于任意stg来说，检查这一点是EXPSPACE-hard的，因此很多注意力都放在了自由选择stg的子类上，它在表达能力和可分析性之间提供了一个很好的折衷。在过去的几年里，多项式时间合成技术已经发展为自由选择的STG，但他们假设STG具有一致的二进制编码。本文给出了检验一致性的第一个多项式算法。

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

查看原文本刊更多论文

A polynomial-time algorithm for checking consistency of free-choice signal transition graphs

Signal transition graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent and complete binary encoding. Checking this is EXPSPACE-hard for arbitrary STGs, and so a lot of attention has been devoted to the subclass of free-choice STGs, which offers a good compromise between expressive power and analyzability. In the last years, polynomial time synthesis techniques have been developed for free-choice STGs, but they assume that the STG has a consistent binary encoding. The first polynomial algorithm for checking consistency is presented here.

求助全文

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

来源期刊

Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.

自引率

0.00%

发文量