Table 5 Comparison of BPMN formal...

Table 5

Comparison of BPMN formal verification approaches published during or after 2017

Reference	Logic system¹	Languages and systems²	Auxiliary representations³
Corradini et al. (2018)	LTL^a	Maude	–
Dechsupa et al. (2018, 2019, 2021)	CTL^b	–	CPN^c, CFG^d
Durán et al. (2018)	Rewriting logic	Maude	–
Kheldoun et al. (2017)	LTL^a	Maude	RECATNet^e
Meghzili et al. (2020)	LTL^a	–	CPN^c
Szpyrka et al. (2017)	μ-calculus	Alvis, Haskell	LTS^f graph

Reference	Logicsystem¹	Languagesand systems²	Auxiliaryrepresentations³
Corradini et al. (2018)	LTL^a	Maude	–
Dechsupa et al. (2018, 2019, 2021)	CTL^b	–	CPN^c, CFG^d
Durán et al. (2018)	Rewriting logic	Maude	–
Kheldoun et al. (2017)	LTL^a	Maude	RECATNet^e
Meghzili et al. (2020)	LTL^a	–	CPN^c
Szpyrka et al. (2017)	μ-calculus	Alvis, Haskell	LTS^f graph

Note(s): ¹ System of logical rules serving as the basis for the solution

² Software languages and software systems used

³ Intermediate auxiliary representations that the original BPMN model is transformed into

^a Linear Temporal Logic

^a Computation Tree Logic

^c Colored Petri Net

^d Control Flow Graph

^e Recursive Extended Concurrent Algebraic Term Net

^f Labeled Transition System

Source(s): Table by authors

Sharing Unavailable