Deadlock-freedom in component systems with architectural constraints

Martens, Moritz; Majster-Cederbaum, Mila

doi:10.1007/s10703-012-0160-6

Cited by 2 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…No complexity bounds are given. Martens and Majster-Cederbaum [14] present a polynomial time checkable deadlock freedom condition based on structural restrictions: "the communication structure between the components is given by a tree." This restriction allows them to analyze only pair systems.…”

Section: Experiment: Gas Stationmentioning

confidence: 99%

An Abstract Framework for Deadlock Prevention in BIP

Attie

Bensalem

Bozga

et al. 2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract. We present a sound but incomplete criterion for checking deadlock freedom of finite state systems expressed in BIP: a componentbased 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 modelchecking 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.

show abstract

Section: Experiment: Gas Stationmentioning

confidence: 99%

An Abstract Framework for Deadlock Prevention in BIP

Attie

Bensalem

Bozga

et al. 2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

show abstract

“…No complexity bounds are given. [23] present a polynomial time checkable deadlock freedom condition based on structural restrictions: "the communication structure between the components is given by a tree. " This restriction allows them to analyze only pair systems.…”

Section: Related Work Discussion and Further Workmentioning

confidence: 99%

“…A local deadlock occurs when a subsystem is deadlocked while the rest of the system can execute. Other criteria in the literature [2,3,13,17,21,23,24,29] guarantee only global deadlock freedom.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Global and Local Deadlock Freedom in BIP

Attie

Bensalem

Bozga

et al. 2017

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

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.

show abstract

Deadlock-freedom in component systems with architectural constraints

Cited by 2 publications

References 23 publications

An Abstract Framework for Deadlock Prevention in BIP

An Abstract Framework for Deadlock Prevention in BIP

Global and Local Deadlock Freedom in BIP

Contact Info

Product

Resources

About