Expressing BBUFs Lookup Using the π-Calculus

Gabriel Ciobanu, Dan Cojocar
{"title":"Expressing BBUFs Lookup Using the π-Calculus","authors":"Gabriel Ciobanu, Dan Cojocar","doi":"10.1109/SYNASC.2014.74","DOIUrl":null,"url":null,"abstract":"In this paper we express Babes Bolyai University File System lookup mechanism by using π-calculus. We describe the lookup process in a peer-to-peer decentralized system, how a request message is forwarded from a client to a system node, and how the response is replied. The formally specified protocol is verified by using the Mobility Workbench model-checker.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2014.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we express Babes Bolyai University File System lookup mechanism by using π-calculus. We describe the lookup process in a peer-to-peer decentralized system, how a request message is forwarded from a client to a system node, and how the response is replied. The formally specified protocol is verified by using the Mobility Workbench model-checker.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用π-微积分表达bbuf查找
本文用π微积分表达了博雅大学档案系统的查找机制。我们描述了点对点分散系统中的查找过程,请求消息如何从客户机转发到系统节点,以及如何响应。使用Mobility Workbench模型检查器验证正式指定的协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evaluating Weighted Round Robin Load Balancing for Cloud Web Services Lipschitz Bounds for Noise Robustness in Compressive Sensing: Two Algorithms Open and Interoperable Socio-technical Networks Computing Homological Information Based on Directed Graphs within Discrete Objects Automated Synthesis of Target-Dependent Programs for Polynomial Evaluation in Fixed-Point Arithmetic
×
引用
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