Global and Local Deadlock Freedom in BIP

Author:

Attie Paul C.1ORCID,Bensalem Saddek2,Bozga Marius3,Jaber Mohamad1,Sifakis Joseph4,Zaraket Fadi A.1

Affiliation:

1. American University of Beirut, Lebanon

2. UJF-Grenoble 1/CNRS VERIMAG, France, Saddek

3. UJF-Grenoble 1/CNRS VERIMAG, France, Marius

4. Ecole Polytechnique Federale, Lausanne, Switzerland

Abstract

We present a criterion for checking local and global deadlock freedom of finite state systems expressed in BIP: a component-based framework for constructing complex distributed systems. Our criterion is evaluated by model-checking a set of subsystems of the overall large system. If satisfied in small subsystems, it implies deadlock-freedom of the overall system. If not satisfied, then we re-evaluate over larger subsystems, which improves the accuracy of the check. When the subsystem being checked becomes the entire system, our criterion becomes complete for deadlock-freedom. Hence our criterion only fails to decide deadlock freedom because of computational limitations: state-space explosion sets in when the subsystems become too large. Our method thus combines the possibility of fast response together with theoretical completeness. Other criteria for deadlock freedom, in contrast, are incomplete in principle, and so may fail to decide deadlock freedom even if unlimited computational resources are available. Also, our criterion certifies freedom from local deadlock, in which a subsystem is deadlocked while the rest of the system executes. Other criteria only certify freedom from global deadlock. We present experimental results for dining philosophers and for a multi-token-based resource allocation system, which subsumes several data arbiters and schedulers, including Milner’s token-based scheduler.

Funder

University Research Board (URB) at the American University of Beirut

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Team Automata: Overview and Roadmap;Lecture Notes in Computer Science;2024

2. Approximate verification of concurrent systems using token structures and invariants;International Journal on Software Tools for Technology Transfer;2022-04-07

3. Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving;ACM Transactions on Software Engineering and Methodology;2019-08-17

4. Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving;Formal Aspects of Computing;2019-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3