{"title":"一种应用于基于状态设计的功能分解方法","authors":"Luke Demoracski, D. Avresky","doi":"10.1109/RSP.2005.13","DOIUrl":null,"url":null,"abstract":"This paper presents a new approach for functional decomposition of complex systems by applying and enhancing the concepts of clique-decomposition and superstate formation. This approach can be utilized by graphs and state-based software or hardware designs. This method extends the design flow process by automatically extracting states from an existing design and decomposing the states into submodules. The automatic state extraction can be performed either using an original tool or the existing Debussy nState tool. This method has been applied successfully to graphs and state-based Verilog programs, as illustrated by examples in this paper. Furthermore, the complexity analysis shows the underlying algorithm executes well.","PeriodicalId":262048,"journal":{"name":"16th IEEE International Workshop on Rapid System Prototyping (RSP'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An approach for functional decomposition applied to state-based designs\",\"authors\":\"Luke Demoracski, D. Avresky\",\"doi\":\"10.1109/RSP.2005.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new approach for functional decomposition of complex systems by applying and enhancing the concepts of clique-decomposition and superstate formation. This approach can be utilized by graphs and state-based software or hardware designs. This method extends the design flow process by automatically extracting states from an existing design and decomposing the states into submodules. The automatic state extraction can be performed either using an original tool or the existing Debussy nState tool. This method has been applied successfully to graphs and state-based Verilog programs, as illustrated by examples in this paper. Furthermore, the complexity analysis shows the underlying algorithm executes well.\",\"PeriodicalId\":262048,\"journal\":{\"name\":\"16th IEEE International Workshop on Rapid System Prototyping (RSP'05)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"16th IEEE International Workshop on Rapid System Prototyping (RSP'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RSP.2005.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"16th IEEE International Workshop on Rapid System Prototyping (RSP'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RSP.2005.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An approach for functional decomposition applied to state-based designs
This paper presents a new approach for functional decomposition of complex systems by applying and enhancing the concepts of clique-decomposition and superstate formation. This approach can be utilized by graphs and state-based software or hardware designs. This method extends the design flow process by automatically extracting states from an existing design and decomposing the states into submodules. The automatic state extraction can be performed either using an original tool or the existing Debussy nState tool. This method has been applied successfully to graphs and state-based Verilog programs, as illustrated by examples in this paper. Furthermore, the complexity analysis shows the underlying algorithm executes well.