Formal specification and verification of a team formation protocol using TLA+

Rajdeep Niyogi, Amar Nath
{"title":"Formal specification and verification of a team formation protocol using TLA+","authors":"Rajdeep Niyogi, Amar Nath","doi":"10.1002/spe.3307","DOIUrl":null,"url":null,"abstract":"Team formation in an environment where some relevant parameters are not known in advance is a challenging problem. Communicating automata and distributed algorithms have been used to describe protocols for team formation. A high-level specification provides a mathematical description of a protocol or a program. TLA<math altimg=\"urn:x-wiley:spe:media:spe3307:spe3307-math-0003\" display=\"inline\" location=\"graphic/spe3307-math-0003.png\" overflow=\"scroll\">\n<semantics>\n<mrow>\n<msup>\n<mrow></mrow>\n<mrow>\n<mo>+</mo>\n</mrow>\n</msup>\n</mrow>\n$$ {}^{+} $$</annotation>\n</semantics></math> is a formal specification language designed to provide high-level specifications of concurrent and distributed systems. The associated model checker known as TLC is capable of model checking the TLA<math altimg=\"urn:x-wiley:spe:media:spe3307:spe3307-math-0004\" display=\"inline\" location=\"graphic/spe3307-math-0004.png\" overflow=\"scroll\">\n<semantics>\n<mrow>\n<msup>\n<mrow></mrow>\n<mrow>\n<mo>+</mo>\n</mrow>\n</msup>\n</mrow>\n$$ {}^{+} $$</annotation>\n</semantics></math> specifications. Recently, formal specification of a team formation protocol is given using TLA<math altimg=\"urn:x-wiley:spe:media:spe3307:spe3307-math-0005\" display=\"inline\" location=\"graphic/spe3307-math-0005.png\" overflow=\"scroll\">\n<semantics>\n<mrow>\n<msup>\n<mrow></mrow>\n<mrow>\n<mo>+</mo>\n</mrow>\n</msup>\n</mrow>\n$$ {}^{+} $$</annotation>\n</semantics></math> when there is a single initiator (an agent or a robot) that initiates the team formation. Using TLA<math altimg=\"urn:x-wiley:spe:media:spe3307:spe3307-math-0006\" display=\"inline\" location=\"graphic/spe3307-math-0006.png\" overflow=\"scroll\">\n<semantics>\n<mrow>\n<msup>\n<mrow></mrow>\n<mrow>\n<mo>+</mo>\n</mrow>\n</msup>\n</mrow>\n$$ {}^{+} $$</annotation>\n</semantics></math>, we examine the formal specification for the multiple initiator situation and demonstrate that a composition technique can yield a single monolithic specification for the multiple initiator situation from the single initiator situation specification. We have used models of varying sizes, and the TLC model checker has confirmed that the protocol's specifications meet certain desired characteristics in each case.","PeriodicalId":21899,"journal":{"name":"Software: Practice and Experience","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Software: Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/spe.3307","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Team formation in an environment where some relevant parameters are not known in advance is a challenging problem. Communicating automata and distributed algorithms have been used to describe protocols for team formation. A high-level specification provides a mathematical description of a protocol or a program. TLA + $$ {}^{+} $$ is a formal specification language designed to provide high-level specifications of concurrent and distributed systems. The associated model checker known as TLC is capable of model checking the TLA + $$ {}^{+} $$ specifications. Recently, formal specification of a team formation protocol is given using TLA + $$ {}^{+} $$ when there is a single initiator (an agent or a robot) that initiates the team formation. Using TLA + $$ {}^{+} $$ , we examine the formal specification for the multiple initiator situation and demonstrate that a composition technique can yield a single monolithic specification for the multiple initiator situation from the single initiator situation specification. We have used models of varying sizes, and the TLC model checker has confirmed that the protocol's specifications meet certain desired characteristics in each case.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用 TLA+ 正式规范和验证团队组建协议
在某些相关参数事先未知的环境中组建团队是一个具有挑战性的问题。通信自动机和分布式算法已被用于描述团队组建协议。高级规范提供了协议或程序的数学描述。TLA+$$ {}^{+} $$ 是一种形式化规范语言,旨在提供并发和分布式系统的高级规范。被称为 TLC 的相关模型检查器能够对 TLA+$$ {}^{+} $$ 规范进行模型检查。最近,使用 TLA+$$ {}^{+} $$给出了团队组建协议的正式规范,当时只有一个发起者(代理或机器人)发起团队组建。利用 TLA+$$ {}^{+} $$,我们研究了多发起者情况下的形式规范,并证明了一种组合技术可以从单发起者情况规范中生成多发起者情况下的单一整体规范。我们使用了不同大小的模型,TLC 模型检查器证实,在每种情况下,协议的规范都符合某些所需的特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Algorithms for generating small random samples A comprehensive survey of UPPAAL‐assisted formal modeling and verification Large scale system design aided by modelling and DES simulation: A Petri net approach Empowering software startups with agile methods and practices: A design science research Space‐efficient data structures for the inference of subsumption and disjointness relations
×
引用
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