Model Checking Analysis of Semantically Annotated Business Processes

Author(s):  
María José Ibanez ◽  
Javier Fabra ◽  
Pedro Alvarez ◽  
Joaquín Ezpeleta
Author(s):  
Wihem Arsac ◽  
Luca Compagna ◽  
Giancarlo Pellegrino ◽  
Serena Elisa Ponta

2012 ◽  
Vol 601 ◽  
pp. 401-405
Author(s):  
Wen Bo Zhou ◽  
Shu Zhen Yao

The degree of flexibility of workflow management systems heavily influences the way business processes are executed. Constraint-based models are considered to be more flexible than traditional models because of their semantics: everything that does not violate constraints is allowed. More and more people use declarative languages to define workflow, such as linear temporal logic. But how to guarantee the correctness of the model based on the linear temporal logic is still a problem. This article proposes a way to verify the model based on Büchi automaton and gives the corresponding algorithms. Thus the verification of declarative workflow based on the linear temporal logic is solved.


Author(s):  
Giuseppe De Giacomo ◽  
Paolo Felli ◽  
Marco Montali ◽  
Giuseppe Perelli

Temporal logics over finite traces, such as LTLf and its extension LDLf, have been adopted in several areas, including Business Process Management (BPM), to check properties of processes whose executions have an unbounded, but finite, length. These logics express properties of single traces in isolation, however, especially in BPM it is also of interest to express properties over the entire log, i.e., properties that relate multiple traces of the log at once. In the case of infinite-traces, HyperLTL has been proposed to express these ``hyper'' properties. In this paper, motivated by BPM, we introduce HyperLDLf, a logic that extends LDLf with the hyper features of HyperLTL. We provide a sound, complete and computationally optimal technique, based on DFAs manipulation, for the model checking problem in the relevant case where the set of traces (i.e., the log) is a regular language. We illustrate how this form of model checking can be used for verifying log of business processes and for advanced forms of process mining.


2021 ◽  
pp. 116-132
Author(s):  
Ikram Garfatta ◽  
Kaïs Klai ◽  
Mohamed Graïet ◽  
Walid Gaaloul

Author(s):  
Luke T. Herbert ◽  
Robin Sharp

We present a framework for the optimisation of business processes modelled in the business process modelling language BPMN, which builds upon earlier work, where we developed a model checking based method for the analysis of BPMN models. We define a structure for expressing optimisation goals for synthesized BPMN components, based on probabilistic computation tree logic and real-valued reward structures of the BPMN model, allowing for the specification of complex quantitative goals. We here present a simple algorithm, inspired by concepts from evolutionary algorithms, which iteratively generates candidate improved processes based on the fittest of the previous generation. The evaluation of the fitness of each candidate in a generation is performed via model checking, detailed in previous work. At each iteration, this allows the determination of the precise numerical evaluation of the performance of a candidate in terms of the specified goals. A discussion of this method’s application, and the degree of optimization which is possible, is illustrated using an example drawn from the healthcare industry.


2014 ◽  
Vol 40 ◽  
pp. 1-22 ◽  
Author(s):  
Alessandro Armando ◽  
Serena Elisa Ponta

2014 ◽  
Vol 17 (2) ◽  
Author(s):  
Luis E. Mendoza Morales

The most important result to standardize the notation for graphical representation of Business Processes (BPs) is the Business Process Model and Notation (BPMN). Despite the BPs modeled with BPMN being able to support business designers, BPMN models are not appropriate to support the analysis phase. BPMN models have no formal seman- tics to conduct qualitative analysis (validation and verification). In this work is presented how Model Checking (MC) verification technique for software and Timed Automata (TA) formal language are integrated within a formal verification approach to check BPs mod- eled with BPMN. Also, are introduced a set of guideline to transform BPMN models into TA. The use of our approach allow to business analysts and designers to perform evaluation (i.e., qualitative analysis) of BPs, based on the formal specification of BP–task model with TA. The application of the approach is aimed to evaluate the behavior of the BP–task model with respect to business performance indicators (for instance, service time, waiting time or queue size) derived from business needs, as is shown in an instance of an enterprise–project related to Customer Relationship Management.


Sign in / Sign up

Export Citation Format

Share Document