Hypercube Graph Decomposition for Boolean Simplification: An Optimization of Business Process Verification

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

Keywords

Related Articles

Mind-Reading System - A Cutting-Edge Technology

In this paper, we describe a human-computer interface (HCI) system that includes an enabler for controlling gadgets based on signal analysis of brain activities transmitted from the enabler to the gadgets. The enabler is...

Bi-Objective Task Scheduling in Cloud Computing using Chaotic Bat Algorithm

Cloud computing is a technology for providing services over the Internet. It gives approach to renting IT infrastructures on a short-term pay- per-usage basis. One of the service provider’s goals is to use the resources...

MULTITHREADING IMAGE PROCESSING IN SINGLE-CORE AND MULTI-CORE CPU USING JAVA

Multithreading has been shown to be a powerful approach for boosting a system performance. One of the good examples of applications that benefits from multithreading is image processing. Image processing requires many re...

A GA-Based Replica Placement Mechanism for Data Grid

Data Grid is an infrastructure that manages huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. To increase resource availability and to ease resourc...

Abnormal Region Extraction from MR Brain Images using Hybrid Approach

Automatic brain abnormality segmentation from magnetic resonance images is a key task that is performed by computer aided algorithm or manual extraction by a medical expert. The regions are often partitioned based on the...

Download PDF file
  • EP ID EP468647
  • DOI 10.14569/IJACSA.2019.0100261
  • Views 93
  • Downloads 0

How To Cite

Mohamed NAOUM, Outman EL HICHAMI, Mohammed AL ACHHAB, Badr eddine EL MOHAJIR (2019). Hypercube Graph Decomposition for Boolean Simplification: An Optimization of Business Process Verification. International Journal of Advanced Computer Science & Applications, 10(2), 467-473. https://europub.co.uk/articles/-A-468647