基于时序图规范的多范式控制器综合方法

Wolf-Dieter Tiedemann
{"title":"基于时序图规范的多范式控制器综合方法","authors":"Wolf-Dieter Tiedemann","doi":"10.1109/EURDAC.1992.246314","DOIUrl":null,"url":null,"abstract":"The author reports on two high-level synthesis methods to derive controller implementations following different design paradigms from a common natural specification by timing diagrams. The first method automatically generates a Mealy automaton to be an input for a variety of excellent finite state machine (FSM) design algorithms. The second method supports an interactive bottom-up synthesis of asynchronous designs. Both methods are founded on the same mathematical basis, notably a process calculus. Due to their formal manifestation, every transformation (synthesis step) is verifiable. This leads to guaranteed correct implementations.<<ETX>>","PeriodicalId":218056,"journal":{"name":"Proceedings EURO-DAC '92: European Design Automation Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"An approach to multi-paradigm controller synthesis from timing diagram specifications\",\"authors\":\"Wolf-Dieter Tiedemann\",\"doi\":\"10.1109/EURDAC.1992.246314\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author reports on two high-level synthesis methods to derive controller implementations following different design paradigms from a common natural specification by timing diagrams. The first method automatically generates a Mealy automaton to be an input for a variety of excellent finite state machine (FSM) design algorithms. The second method supports an interactive bottom-up synthesis of asynchronous designs. Both methods are founded on the same mathematical basis, notably a process calculus. Due to their formal manifestation, every transformation (synthesis step) is verifiable. This leads to guaranteed correct implementations.<<ETX>>\",\"PeriodicalId\":218056,\"journal\":{\"name\":\"Proceedings EURO-DAC '92: European Design Automation Conference\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings EURO-DAC '92: European Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURDAC.1992.246314\",\"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 EURO-DAC '92: European Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURDAC.1992.246314","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

作者报告了两种高级综合方法,通过时序图从共同的自然规范中派生出遵循不同设计范式的控制器实现。第一种方法自动生成一个Mealy自动机作为各种优秀的有限状态机(FSM)设计算法的输入。第二种方法支持异步设计的交互式自底向上综合。这两种方法都建立在相同的数学基础上,特别是过程演算。由于它们的形式化表现,每个转换(合成步骤)都是可验证的。这保证了正确的实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An approach to multi-paradigm controller synthesis from timing diagram specifications
The author reports on two high-level synthesis methods to derive controller implementations following different design paradigms from a common natural specification by timing diagrams. The first method automatically generates a Mealy automaton to be an input for a variety of excellent finite state machine (FSM) design algorithms. The second method supports an interactive bottom-up synthesis of asynchronous designs. Both methods are founded on the same mathematical basis, notably a process calculus. Due to their formal manifestation, every transformation (synthesis step) is verifiable. This leads to guaranteed correct implementations.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信