An algebraic specification of a daisy chain arbiter

Y.R. Hou, A. Ohnishi, Y. Sugiyama, T. Okamoto
{"title":"An algebraic specification of a daisy chain arbiter","authors":"Y.R. Hou, A. Ohnishi, Y. Sugiyama, T. Okamoto","doi":"10.1109/RFTS.1991.212970","DOIUrl":null,"url":null,"abstract":"There have been few studies on formal approaches to the specification and realization of asynchronous digital circuits. The paper describes an algebraic method of specifying the abstract behavior of an asynchronous daisy chain arbiter as an example of them. In asynchronous circuits, changes of inputs cause state transitions. Thus the states after transitions are determined by the states before the transitions and the inputs after the changes, and when one component make a transition, some of the other components do not. The paper presents a representation of these relations. This algebraic method can be applied to many of the other asynchronous digital circuits.<<ETX>>","PeriodicalId":349410,"journal":{"name":"[1991] Proceedings Pacific Rim International Symposium on Fault Tolerant Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings Pacific Rim International Symposium on Fault Tolerant Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RFTS.1991.212970","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

There have been few studies on formal approaches to the specification and realization of asynchronous digital circuits. The paper describes an algebraic method of specifying the abstract behavior of an asynchronous daisy chain arbiter as an example of them. In asynchronous circuits, changes of inputs cause state transitions. Thus the states after transitions are determined by the states before the transitions and the inputs after the changes, and when one component make a transition, some of the other components do not. The paper presents a representation of these relations. This algebraic method can be applied to many of the other asynchronous digital circuits.<>
菊花链仲裁器的代数规范
关于异步数字电路的规范和实现的形式化方法的研究很少。本文以异步菊花链仲裁器的抽象行为为例,给出了一种代数方法来表示异步菊花链仲裁器的抽象行为。在异步电路中,输入的变化引起状态转换。因此,转换后的状态由转换前的状态和更改后的输入决定,当一个组件进行转换时,其他一些组件不进行转换。本文给出了这些关系的表示。这种代数方法可以应用于许多其他异步数字电路。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书