Skip to Main content Skip to Navigation
Conference papers

An Abstract Framework for Deadlock Prevention in BIP

Abstract : We present a sound but incomplete criterion for checking deadlock freedom of finite state systems expressed in BIP: a component-based framework for the construction of complex distributed systems. Since deciding deadlock-freedom for finite-state concurrent systems is PSPACE-complete, our criterion gives up completeness in return for tractability of evaluation. Our criterion can be evaluated by model-checking subsystems of the overall large system. The size of these subsystems depends only on the local topology of direct interaction between components, and not on the number of components in the overall system. We present two experiments, in which our method compares favorably with existing approaches. For example, in verifying deadlock freedom of dining philosphers, our method shows linear increase in computation time with the number of philosophers, whereas other methods (even those that use abstraction) show super-linear increase, due to state-explosion.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download
Contributor : Marius Bozga <>
Submitted on : Thursday, April 27, 2017 - 1:24:57 PM
Last modification on : Thursday, July 9, 2020 - 9:43:28 AM
Document(s) archivé(s) le : Friday, July 28, 2017 - 12:53:54 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Paul C. Attie, Saddek Bensalem, Marius Bozga, Mohamad Jaber, Joseph Sifakis, et al.. An Abstract Framework for Deadlock Prevention in BIP. 15th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOOODS) / 33th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2013, Florence, Italy. pp.161-177, ⟨10.1007/978-3-642-38592-6_12⟩. ⟨hal-00878752⟩



Record views


Files downloads