An Abstract Framework for Deadlock Prevention in BIP
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.
KeywordsReachable State Composite Component Atomic Component Abstract Framework Proof Sketch
- 6.Basu, A., Bozga, M., Sifakis, J.: Modeling Heterogeneous Real-time Components in BIP. In: SEFM, pp. 3–12 (September 2006)Google Scholar
- 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
- 14.Martens, M., Majster-Cederbaum, M.: Deadlock-freedom in component systems with architectural constraints. FMSD 41, 129–177 (2012)Google Scholar
- 15.Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)Google Scholar