服务规范:to B,或not to B

B. Mermet, D. Méry
{"title":"服务规范:to B,或not to B","authors":"B. Mermet, D. Méry","doi":"10.1145/298595.298859","DOIUrl":null,"url":null,"abstract":"The paper introduces a new use for the B method as a means of specifying telecommunication services with the help of abstract machines and, consequently, it defines a formal framework for studying the feature interaction problem. An interaction is defined as a violation of an invariant and is detected when combining two or more abstract machines. The current B method is extended to allow the composition of abstract machines. The B method is supported by sofware that helps the specifier of services and features. We have not only modelled services within the B technology, but we have also extended the possibilities of B through the composition of abstract machines.","PeriodicalId":125560,"journal":{"name":"Formal Methods in Software Practice","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Service specifications: to B, or not to B\",\"authors\":\"B. Mermet, D. Méry\",\"doi\":\"10.1145/298595.298859\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper introduces a new use for the B method as a means of specifying telecommunication services with the help of abstract machines and, consequently, it defines a formal framework for studying the feature interaction problem. An interaction is defined as a violation of an invariant and is detected when combining two or more abstract machines. The current B method is extended to allow the composition of abstract machines. The B method is supported by sofware that helps the specifier of services and features. We have not only modelled services within the B technology, but we have also extended the possibilities of B through the composition of abstract machines.\",\"PeriodicalId\":125560,\"journal\":{\"name\":\"Formal Methods in Software Practice\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Formal Methods in Software Practice\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/298595.298859\",\"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.298859","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文介绍了B方法在抽象机器的帮助下作为指定电信服务的一种新用途,从而定义了一个研究特征交互问题的形式化框架。交互被定义为对不变量的违反,并在组合两个或多个抽象机器时检测到。将现有的B方法扩展到允许抽象机器的组合。B方法由帮助说明服务和特性的软件支持。我们不仅在B技术中对服务进行建模,而且还通过抽象机器的组合扩展了B的可能性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Service specifications: to B, or not to B
The paper introduces a new use for the B method as a means of specifying telecommunication services with the help of abstract machines and, consequently, it defines a formal framework for studying the feature interaction problem. An interaction is defined as a violation of an invariant and is detected when combining two or more abstract machines. The current B method is extended to allow the composition of abstract machines. The B method is supported by sofware that helps the specifier of services and features. We have not only modelled services within the B technology, but we have also extended the possibilities of B through the composition of abstract machines.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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