A projection-stable grammatical model for the distributed execution of administrative processes with emphasis on actors’ views

Ndadji, Milliam Maxime Zekeng; Tchendji, Maurice Tchoupé; Djamegni, Clémentin Tayou; Parigot, Didier

doi:10.1016/j.jksuci.2021.07.019

Cited by 2 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To better illustrate the presented concepts, let us take as an application case, the serialisation of the LSAWfP model coming from the running example of [13]. The considered GMWf G = (S, P, A) is the one describing a peer review process.…”

Section: An Illustrative Examplementioning

confidence: 99%

Non-Recursive LSAWfP Models are Structured Workflows

Ndadji

Bruno

Tchendji

2023

Revue Africaine De Recherche en Informatique Et Mathématiques Appliquées

View full text Add to dashboard Cite

Éditeurs: Mathieu Roche, Nabil Gmati, Amel Ben Abda, Marcellin Nkenlifack 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. Les langages de workflow occupent une place importante dans la discipline du Business Process Management (BPM) : ils sont utilisés pour modéliser les processus opérationnels afin de faciliter leur gestion automatique à l'aide de systèmes BPM. Il existe de nombreux langages de workflow qui traitent de divers aspects (expressivité, analyse formelle, etc.). Au cours de la dernière décennie, certains langages de workflow basés sur des grammaires algébriques (ayant alors une sémantique formelle) et offrant de nouvelles perspectives à la modélisation des processus ont vu le jour : LSAWfP (a Language for the Specification of Administrative Workflow Processes) est l'un d'entre eux. LSAWfP présente de nombreux avantages par rapport aux langages existants, mais c'est son expressivité (qui a été très peu abordée dans les travaux antérieurs) qui est étudiée dans le présent document. En effet, les travaux présentés dans ce document visent à démontrer que tout modèle LSAWfP non récursif est un workflow structuré. Sachant que la majorité des systèmes BPM commerciaux ne gèrent que des workflows structurés, le résultat de cette étude montre que, bien que LSAWfP soit encore très théorique, il est un langage au potentiel économique certain.

show abstract

Section: An Illustrative Examplementioning

confidence: 99%