Milliam Maxime Zekeng Ndadji ; Daniela Marionne Nguedia Momo ; Franck Bruno Tonle Noumbo ; Maurice Tchoupé Tchendji - Non-Recursive LSAWfP Models are Structured Workflows

arima:11183 - Revue Africaine de Recherche en Informatique et Mathématiques Appliquées, July 5, 2023, Volume 38 - Special issue CARI 2022 - 2023 -
Non-Recursive LSAWfP Models are Structured WorkflowsArticle

Authors: Milliam Maxime Zekeng Ndadji ORCID1,2; Daniela Marionne Nguedia Momo 1,2; Franck Bruno Tonle Noumbo ORCID1,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.

Volume: Volume 38 - Special issue CARI 2022 - 2023
Published on: July 5, 2023
Accepted on: July 4, 2023
Submitted on: April 13, 2023
Keywords: BPM,LSAWfP,Structured Workflows,Dyck Language,Serialisation,BPM,LSAWfP,Workflows Structurés,Langage de Dyck,Sérialisation,[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL],[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE],[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Consultation statistics

This page has been seen 367 times.
This article's PDF has been downloaded 215 times.