Hypercube Graph Decomposition for Boolean Simplification: An Optimization of Business Process Verification
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2019, Vol 10, Issue 2
Abstract
This paper deals with the optimization of busi-ness processes (BP) verification by simplifying their equivalent algebraic expressions. Actual approaches of business processes verification use formal methods such as automated theorem proving and model checking to verify the accuracy of the business process design. Those processes are abstracted to mathematical models in order to make the verification task possible. However, the structure of those mathematical models is usually a Boolean expression of the business process variables and gateways. Thus leading to a combinatorial explosion when the number of literals is above a certain threshold. This work aims at optimizing the verification task by managing the problem size. A novel algorithm of Boolean simplification is proposed. It uses hypercube graph decomposition to find the minimal equivalent formula of a business process model given in its disjunctive normal form (DNF). Moreover, the optimization method is totally automated and can be applied to any business process having the same formula due to the independence of the Boolean simplification rules from the studied processes. This new approach has been numerically validated by comparing its performance against the state of the art method Quine-McCluskey (QM) through the optimization of several processes with various types of branching.
Authors and Affiliations
Mohamed NAOUM, Outman EL HICHAMI, Mohammed AL ACHHAB, Badr eddine EL MOHAJIR
Joint Operation in Public Key Cryptography
We believe that there is no real data protection without our own tools. Therefore, our permanent aim is to have more of our own codes. In order to achieve that, it is necessary that a lot of young researchers become inte...
Development of Talent Model based on Publication Performance using Apriori Technique
The main problem or challenge faced by Human Resource Management (HRM) is to recognize, develop and manage talent efficiently and effectively. This is because HRM is responsible for selecting the correct talent for suita...
All in Focus Image Generation based on New Focusing Measure Operators
To generate an all in focus image, the Shape-From-Focus (SFF) is used. The SFF key is finding the optimal focus depth at each pixel or area in an image within sequence of images. In this paper two new focusing measure op...
Software Product Line Test List Generation based on Harmony Search Algorithm with Constraints Support
In software product line (SPL), selecting product's features to be tested is an essential issue to enable the manufactories to release new products earlier than others. Practically, it is impossible to test all the produ...
A Hindi Speech Actuated Computer Interface for Web Search
Aiming at increasing system simplicity and flexibility, an audio evoked based system was developed by integrating simplified headphone and user-friendly software design. This paper describes a Hindi Speech Actuated Compu...