Authors: Milliam Maxime Zekeng Ndadji ^1,2; Daniela Marionne Nguedia Momo ^1,2; Franck Bruno Tonle Noumbo ^1,2,3; Maurice Tchoupé Tchendji ^1,2

• 1 Université de Dschang
• 2 Faculté des Sciences - Université de Dschang [Cameroun]
• 3 International Centre of Insect Physiology and Ecology

Workflow languages are a key component of the Business Process Management (BPM) discipline: they are used to model business processes in order to facilitate their automatic management by means of BPM systems. There are numerous workflow languages addressing various issues (expressiveness, formal analysis, etc.). In the last decade, some workflow languages based on context-free grammars (having then formal semantics) and offering new perspectives to process modelling, have emerged: LSAWfP (a Language for the Specification of Administrative Workflow Processes) is one of them. LSAWfP has many advantages over other existing languages, but it is its expressiveness (which has been very little addressed in previous works) that is studied in this paper. Indeed, the work in this paper aims to demonstrate that any non-recursive LSAWfP model is a structured workflow. Knowing that the majority of commercial BPM systems only implement structured workflows, the result of this study establishes that, although LSAWfP is still much more theoretical, it is a language with commercial potential.