改进符号产品机器遍历的新模型

[1992] Proceedings 29th ACM/IEEE Design Automation Conference Pub Date : 1992-07-01 DOI:10.1109/DAC.1992.227812

G. Cabodi, P. Camurati, Fulvio Corno, S. Gai, P. Prinetto, M. Reorda

{"title":"改进符号产品机器遍历的新模型","authors":"G. Cabodi, P. Camurati, Fulvio Corno, S. Gai, P. Prinetto, M. Reorda","doi":"10.1109/DAC.1992.227812","DOIUrl":null,"url":null,"abstract":"The authors present algorithms for traversing product machines which improve on the results of H. Cho et al. (1991), with a speedup ranging from 3 up to 6. New features include a model that generalizes the product machine, resulting in simpler and more efficient representations and computations, as well as optimizations in symbolic image computation. In the latter case, the speedup ranged from 1.5 to 4.<<ETX>>","PeriodicalId":162648,"journal":{"name":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"A new model for improving symbolic product machine traversal\",\"authors\":\"G. Cabodi, P. Camurati, Fulvio Corno, S. Gai, P. Prinetto, M. Reorda\",\"doi\":\"10.1109/DAC.1992.227812\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present algorithms for traversing product machines which improve on the results of H. Cho et al. (1991), with a speedup ranging from 3 up to 6. New features include a model that generalizes the product machine, resulting in simpler and more efficient representations and computations, as well as optimizations in symbolic image computation. In the latter case, the speedup ranged from 1.5 to 4.<<ETX>>\",\"PeriodicalId\":162648,\"journal\":{\"name\":\"[1992] Proceedings 29th ACM/IEEE Design Automation Conference\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings 29th ACM/IEEE Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1992.227812\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1992.227812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

摘要

作者提出了遍历产品机器的算法，该算法改进了H. Cho等人(1991)的结果，加速范围从3到6。新功能包括一个一般化产品机器的模型，导致更简单和更有效的表示和计算，以及符号图像计算的优化。在后一种情况下，加速范围从1.5到4。

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

查看原文本刊更多论文

A new model for improving symbolic product machine traversal

The authors present algorithms for traversing product machines which improve on the results of H. Cho et al. (1991), with a speedup ranging from 3 up to 6. New features include a model that generalizes the product machine, resulting in simpler and more efficient representations and computations, as well as optimizations in symbolic image computation. In the latter case, the speedup ranged from 1.5 to 4.<>

求助全文

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

来源期刊

[1992] Proceedings 29th ACM/IEEE Design Automation Conference

自引率

0.00%

发文量