实时过程代数中音频控制协议的验证

Liang Chen
{"title":"实时过程代数中音频控制协议的验证","authors":"Liang Chen","doi":"10.1145/298595.298860","DOIUrl":null,"url":null,"abstract":"1. ABSTRACT In this paper, we formally analyze an audio control protocol developed by Philips. We use real time process algebra to model the protocol and weak bisimulation to verify its implementation against its specification. 1.1 Keywords Communication protoco1, real time system formal methods, process algebra, weak bisimulation. 2. INTRODUCTION In [4], Bosscher, Polak and Vaandrager have formally analyzed, based on weak timed forward simulation by using the timed I/O automata, a simple version of an audio control protocol developed by Philips for the physical layer of an interface bus that connects the various devices of some stereo equipment. The protocol, which uses Manchester encoding, has to deal with a significant uncertainty in the timing events due to both hardware and software constraints. It is a very nice example and therefore it has been suggested as a benchmark for other researchers to test their methods on, just as the Cizt and Mouse example of [lo] and the Gas Burner example of [ 143. Process algebra such as CCS [ll], CSP [9] and ACP [3] have been used to describe and analyze concurrently executing systems including communication protocols. The notion of weak bisimulation provides simple and elegant proof techniques for showing an implementation (usually a parallel process) meets its specification (usually a Permission IO make di&l/hard copy of all or pan of this work for personal or classroom use is gaated without fee provided that copies ate not made of dishibuted for profit or commerci al advantage, the copyright notice, tbe tide of the publication aad its date appear, aad notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish. to post oa servets or to redistribute to lists, requires prior SpeGifiC permission sad/or a fee. sequential process). There are many applications of process algebra for the formal verification of concurrent systems based on weak bisimulation [7,12,13] Recently there are many proposals and resultson real time process algebra. Most of the published .results regard completeness, de&lability and expressiveness issues. Unlike the untimed case, the timed version of weak bisimulation bears criticism of being too fine to be useful in formal verification of real time systems. So far there are very few published results in verification of real time systems (even toy examples) based on timed weak bisimulation. In this paper, we will present a formal analysis of the Philips's audio control protocol based on timed …","PeriodicalId":125560,"journal":{"name":"Formal Methods in Software Practice","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Verification of an audio control protocol within real time process algebra\",\"authors\":\"Liang Chen\",\"doi\":\"10.1145/298595.298860\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"1. ABSTRACT In this paper, we formally analyze an audio control protocol developed by Philips. We use real time process algebra to model the protocol and weak bisimulation to verify its implementation against its specification. 1.1 Keywords Communication protoco1, real time system formal methods, process algebra, weak bisimulation. 2. INTRODUCTION In [4], Bosscher, Polak and Vaandrager have formally analyzed, based on weak timed forward simulation by using the timed I/O automata, a simple version of an audio control protocol developed by Philips for the physical layer of an interface bus that connects the various devices of some stereo equipment. The protocol, which uses Manchester encoding, has to deal with a significant uncertainty in the timing events due to both hardware and software constraints. It is a very nice example and therefore it has been suggested as a benchmark for other researchers to test their methods on, just as the Cizt and Mouse example of [lo] and the Gas Burner example of [ 143. Process algebra such as CCS [ll], CSP [9] and ACP [3] have been used to describe and analyze concurrently executing systems including communication protocols. The notion of weak bisimulation provides simple and elegant proof techniques for showing an implementation (usually a parallel process) meets its specification (usually a Permission IO make di&l/hard copy of all or pan of this work for personal or classroom use is gaated without fee provided that copies ate not made of dishibuted for profit or commerci al advantage, the copyright notice, tbe tide of the publication aad its date appear, aad notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish. to post oa servets or to redistribute to lists, requires prior SpeGifiC permission sad/or a fee. sequential process). There are many applications of process algebra for the formal verification of concurrent systems based on weak bisimulation [7,12,13] Recently there are many proposals and resultson real time process algebra. Most of the published .results regard completeness, de&lability and expressiveness issues. Unlike the untimed case, the timed version of weak bisimulation bears criticism of being too fine to be useful in formal verification of real time systems. So far there are very few published results in verification of real time systems (even toy examples) based on timed weak bisimulation. In this paper, we will present a formal analysis of the Philips's audio control protocol based on timed …\",\"PeriodicalId\":125560,\"journal\":{\"name\":\"Formal Methods in Software Practice\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Formal Methods in Software Practice\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/298595.298860\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Formal Methods in Software Practice","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/298595.298860","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

1. 本文正式分析了飞利浦公司开发的音频控制协议。我们使用实时过程代数对协议进行建模,并使用弱双仿真来验证其实现是否符合其规范。1.1关键词通信协议,实时系统形式化方法,过程代数,弱双仿真2. 在b[4]中,Bosscher, Polak和Vaandrager通过使用定时I/O自动机进行弱定时前向仿真,正式分析了飞利浦为连接某些立体声设备的各种设备的接口总线的物理层开发的音频控制协议的简单版本。该协议使用曼彻斯特编码,由于硬件和软件的限制,必须处理定时事件的重大不确定性。这是一个非常好的例子,因此它被建议作为其他研究人员测试他们的方法的基准,就像Cizt和Mouse的例子[lo]和Gas Burner的例子[143]一样。进程代数如CCS[11]、CSP[9]和ACP[3]已被用于描述和分析包括通信协议在内的并发执行系统。弱bisimulation提供简单和优雅的概念证明显示技术实现(通常是一个平行的过程)符合其规范(通常是一个IO di&l /许可复印件全部或盘的工作为个人或教室使用复制提供gaated不费吃不是利润或由dishibuted commerci基地优势,版权通知,此种潮流出版aad的日期出现,广告注意的是考虑到复制是ACM的许可,公司。复制,再版发布oa服务器或重新分发到列表,需要事先获得特定许可和/或收费。连续的过程)。过程代数在基于弱双仿真的并发系统形式化验证中有许多应用[7,12,13],最近有许多关于实时过程代数的建议和成果。大多数已发表的结果涉及完整性、可解性和表达性问题。与非定时情况不同,弱双模拟的定时版本因过于精细而无法用于实时系统的正式验证而受到批评。到目前为止,在基于时间弱双仿真的实时系统验证(甚至是玩具示例)方面发表的结果很少。在本文中,我们将对Philips的基于定时的音频控制协议进行形式化分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Verification of an audio control protocol within real time process algebra
1. ABSTRACT In this paper, we formally analyze an audio control protocol developed by Philips. We use real time process algebra to model the protocol and weak bisimulation to verify its implementation against its specification. 1.1 Keywords Communication protoco1, real time system formal methods, process algebra, weak bisimulation. 2. INTRODUCTION In [4], Bosscher, Polak and Vaandrager have formally analyzed, based on weak timed forward simulation by using the timed I/O automata, a simple version of an audio control protocol developed by Philips for the physical layer of an interface bus that connects the various devices of some stereo equipment. The protocol, which uses Manchester encoding, has to deal with a significant uncertainty in the timing events due to both hardware and software constraints. It is a very nice example and therefore it has been suggested as a benchmark for other researchers to test their methods on, just as the Cizt and Mouse example of [lo] and the Gas Burner example of [ 143. Process algebra such as CCS [ll], CSP [9] and ACP [3] have been used to describe and analyze concurrently executing systems including communication protocols. The notion of weak bisimulation provides simple and elegant proof techniques for showing an implementation (usually a parallel process) meets its specification (usually a Permission IO make di&l/hard copy of all or pan of this work for personal or classroom use is gaated without fee provided that copies ate not made of dishibuted for profit or commerci al advantage, the copyright notice, tbe tide of the publication aad its date appear, aad notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish. to post oa servets or to redistribute to lists, requires prior SpeGifiC permission sad/or a fee. sequential process). There are many applications of process algebra for the formal verification of concurrent systems based on weak bisimulation [7,12,13] Recently there are many proposals and resultson real time process algebra. Most of the published .results regard completeness, de&lability and expressiveness issues. Unlike the untimed case, the timed version of weak bisimulation bears criticism of being too fine to be useful in formal verification of real time systems. So far there are very few published results in verification of real time systems (even toy examples) based on timed weak bisimulation. In this paper, we will present a formal analysis of the Philips's audio control protocol based on timed …
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Using TAME to prove invariants of automata models: Two case studies Using predicate abstraction to reduce object-oriented programs for model checking Software synthesis and applications (abstract only) Formal modeling of active network nodes using PVS DSD: A schema language for XML
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1