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

A Comprehensive Analysis of E-government services adoption in Saudi Arabia: Obstacles and Challenges

Often referred as Government to Citizen (G2C) e-government services, many governments around the world are developing and utilizing ICT technologies to provide information and services to their citizens. In Saudi Arabia...

Detection of SQL Injection Using a Genetic Fuzzy Classifier System

SQL Injection (SQLI) is one of the most popular vulnerabilities of web applications. The consequences of SQL injection attack include the possibility of stealing sensitive information or bypassing authentication procedur...

Towards No-Reference of Peak Signal to Noise Ratio

The aim of this work is to define a no-referenced perceptual image quality estimator applying the perceptual concepts of the Chromatic Induction Model The approach consists in comparing the received image, presumably deg...

Generating Representative Sets and Summaries for Large Collection of Images Using Image Cropping Techniques and Result Comparison

The collection of photos hosted on photo archives and social networking sites has been increasing exponentially. It is really hard to get the summary of a large image set without browsing through the entire collection. I...

Towards an Adaptive Learning System Based on a New Learning Object Granularity Approach 

To achieve the adaptability required in ALS, adaptive learning system (ALS) takes advantage of granular and reusable content. The main goal of this paper is to examine the learning object granularity issue which is direc...

Download PDF file
  • EP ID EP468647
  • DOI 10.14569/IJACSA.2019.0100261
  • Views 77
  • 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