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
Keywords
Related Articles
- EP ID EP468647
- DOI 10.14569/IJACSA.2019.0100261
- Views 64
- Downloads 0
Software Components’ Coupling Detection for Software Reusability
Most of the software systems design and modeling techniques concentrates on capturing the functional aspects that comprise a system’s architecture. Non-functional aspects are rarely considered on most of the software sys...
Comparative Analysis of ALU Implementation with RCA and Sklansky Adders In ASIC Design Flow
An Arithmetic Logic Unit (ALU) is the heart of every central processing unit (CPU) which performs basic operations like addition, subtraction, multiplication, division and bitwise logic operations on binary numbers. This...
OntoVerbal: a Generic Tool and Practical Application to SNOMED CT
Ontology development is a non-trivial task requiring expertise in the chosen ontological language. We propose a method for making the content of ontologies more transparent by presenting, through the use of natural langu...
Comparative Analysis of Evolutionary Algorithms for Multi-Objective Travelling Salesman Problem
The Evolutionary Computation has grown much in last few years. Inspired by biological evolution, this field is used to solve NP-hard optimization problems to come up with best solution. TSP is most popular and complex pr...
Defects Prediction and Prevention Approaches for Quality Software Development
The demand for distributed and complex business applications in the enterprise requires error-free and high-quality application systems. Unfortunately, most of the developed software contains certain defects which cause...