Business processes modeling is an important step in the process
management cycle because it allows the specification of enterprise
business knowledge. For such purpose and a better evolution of process
modeling, an abstraction level separating algorithmic preoccupation and
management rules is needed. Nowadays, the existing approaches often mix
business rules and algorithmic structures making the process difficult
to support modeling changes. This criticism on *flexibility *is the
first issue in our work. Furthermore, we need to improve the translation
quality of high-level process specification (BPMN, UML AD) to executable
process (BPEL, XPDL). The latter represents the second issue we aim to
tackle: the *verification* process. In this thesis project, we aim so to
offer: (1) A new declarative language based on business rules that
inherits the syntax of the most imperative languages used in industry
(BPEL, XPDL) and which allows constructing execution scenarios
automatically starting from the definition of a buisness rules set. (2)
A translation algorithm of this new declarative language to other
imperative execution languages in order to provide a bridge between BPMS
and BRMS. (3) Formal verification methods for each phase of business
process life cycle.