An Abstract Framework for Deadlock Prevention in BIP

  • Paul C. Attie
  • Saddek Bensalem
  • Marius Bozga
  • Mohamad Jaber
  • Joseph Sifakis
  • Fadi A. Zaraket
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7892)


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.


Reachable State Composite Component Atomic Component Abstract Framework Proof Sketch 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Aldini, A., Bernardo, M.: A General Approach to Deadlock Freedom Verification for Software Architectures. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 658–677. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Attie, P.C.: Synthesis of large concurrent programs via pairwise composition. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 130–145. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  3. 3.
    Attie, P.C., Chockler, H.: Efficiently verifiable conditions for deadlock-freedom of large concurrent programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 465–481. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Attie, P.C., Allen Emerson, E.: Synthesis of Concurrent Systems with Many Similar Processes. TOPLAS 20(1), 51–115 (1998)CrossRefGoogle Scholar
  5. 5.
    Attie, P.C., Francez, N., Grumberg, O.: Fairness and Hyperfairness in Multiparty Interactions. Distributed Computing 6, 245–254 (1993)zbMATHCrossRefGoogle Scholar
  6. 6.
    Basu, A., Bozga, M., Sifakis, J.: Modeling Heterogeneous Real-time Components in BIP. In: SEFM, pp. 3–12 (September 2006)Google Scholar
  7. 7.
    Bensalem, S., Bozga, M., Nguyen, T.H., Sifakis, J.: Compositional verification for component-based systems and application. IET Software 4(3), 181–193 (2010)CrossRefGoogle Scholar
  8. 8.
    Bensalem, S., Griesmayer, A., Legay, A., Nguyen, T.-H., Sifakis, J., Yan, R.: D-finder 2: Towards efficient correctness of incremental design. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 453–458. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  9. 9.
    Bonakdarpour, B., Bozga, M., Jaber, M., Quilbeuf, J., Sifakis, J.: From High-level Component-based Models to Distributed Implementations. In: EMSOFT, pp. 209–218 (2010)Google Scholar
  10. 10.
    Bozga, M., Jaber, M., Maris, N., Sifakis, J.: Modeling Dynamic Architectures Using Dy-BIP. In: Gschwind, T., De Paoli, F., Gruhn, V., Book, M. (eds.) SC 2012. LNCS, vol. 7306, pp. 1–16. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  11. 11.
    Brookes, S.D., Roscoe, A.W.: Deadlock analysis in networks of communicating processes. Distributed Computing 4, 209–230 (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Gößler, G., Sifakis, J.: Component-based construction of deadlock-free systems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 420–433. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  13. 13.
    Heimbold, D., Luckham, D.: Debugging Ada tasking programs. IEEE Software 2(2), 47–57 (1985)CrossRefGoogle Scholar
  14. 14.
    Martens, M., Majster-Cederbaum, M.: Deadlock-freedom in component systems with architectural constraints. FMSD 41, 129–177 (2012)Google Scholar
  15. 15.
    Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2013

Authors and Affiliations

  • Paul C. Attie
    • 1
  • Saddek Bensalem
    • 2
  • Marius Bozga
    • 2
  • Mohamad Jaber
    • 1
  • Joseph Sifakis
    • 3
  • Fadi A. Zaraket
    • 4
  1. 1.Department of Computer ScienceAmerican University of BeirutBeirutLebanon
  2. 2.UJF-Grenoble 1CNRS VERIMAG UMR 5104GrenobleFrance
  3. 3.Rigorous System Design LaboratoryEPFLLausanneSwitzerland
  4. 4.Department of Electrical and Computer EngineeringAmerican University of BeirutBeirutLebanon

Personalised recommendations