Aiming at the problem that there exists very complicated and a large amount of component constraints

an algorithm of component constraint detection based on proposition logic was proposed

in which the proposition in daily diction was transformed into the formal proposition of mathematical logic via the process of proposition symbolization

i.e. five connective words. The proposed method utilizes the concept of constrained truth table to describe the component constraints

and the software architecture

dynamic behavior and transformation among components are revealed transparently and exactly. The truth table is incorporated by inclusion

negation and insertion rules to solve the problem of redundancy and conflict existing in detecting the component constraints. Moreover

a minimal set of rules of the expected behavior is obtained to ensure the consistency of component constraints. Compared to the existing rule pattern table approach

the uncertainty in manual detection is overcome and the temporal performance of detection is improved. The misjudgment of conflict is decreased by 10% and the average processing time is lowered by about 33%.