Skip to Main Content
Deals with the formal specification of dynamic constraints. First of all, we introduce two dynamic constraints which we formally characterise using the B formal specification method. These two dynamic constraints, namely the faithfulness and existence dependency of a binary relationship, are defined using the three mathematical bases of B, viz. predicate logic, set theory and substitution theory. Moreover, we provide for each constraint what is called a proof obligation against which the system's operation specifications must be checked in order to determine whether or not they obey the constraint. This study has raised a general methodology for supporting the specification of a particular type of dynamic constraints in B. The outline of this methodology is presented. We finally show that the constraints we proposed have real-life applications and especially for formally defining the concept of composition in UML (Unified Modeling Language) as an example.