Visualisation of compliant declarative business processes

View/ Open
File version
Accepted Manuscript (AM)
Author(s)
Ghooshchi, Nina Ghanbari
van Beest, Nick
Governatori, Guido
Olivieri, Francesco
Sattar, Abdul
Griffith University Author(s)
Year published
2017
Metadata
Show full item recordAbstract
Organisations typically have to cope with large numbers of business rules and existing regulations governing the business in which they operate. Due to the size and complexity of those rules, maintenance is difficult and it is increasingly complicated to ensure that each business process adheres to those rules. As such, automated extraction of business processes from rules has a number of clear advantages: (1) visualisation of all possible executions allowed by the rules, (2) automated execution and compliance by design, (3) identification of "inefficiencies" in the business rules. Existing approaches, however, only allow ...
View more >Organisations typically have to cope with large numbers of business rules and existing regulations governing the business in which they operate. Due to the size and complexity of those rules, maintenance is difficult and it is increasingly complicated to ensure that each business process adheres to those rules. As such, automated extraction of business processes from rules has a number of clear advantages: (1) visualisation of all possible executions allowed by the rules, (2) automated execution and compliance by design, (3) identification of "inefficiencies" in the business rules. Existing approaches, however, only allow to generate partial traces based on input specifications and cannot handle many different input cases resulting in a full process. This paper presents a formal method to visualise and operationalise such sets of rules as a verifiable business process that is compliant by design and allows us to analyse all possible execution paths. In addition, it maintains information of all distinct input cases, to preserve dependencies between consecutive exclusive paths.
View less >
View more >Organisations typically have to cope with large numbers of business rules and existing regulations governing the business in which they operate. Due to the size and complexity of those rules, maintenance is difficult and it is increasingly complicated to ensure that each business process adheres to those rules. As such, automated extraction of business processes from rules has a number of clear advantages: (1) visualisation of all possible executions allowed by the rules, (2) automated execution and compliance by design, (3) identification of "inefficiencies" in the business rules. Existing approaches, however, only allow to generate partial traces based on input specifications and cannot handle many different input cases resulting in a full process. This paper presents a formal method to visualise and operationalise such sets of rules as a verifiable business process that is compliant by design and allows us to analyse all possible execution paths. In addition, it maintains information of all distinct input cases, to preserve dependencies between consecutive exclusive paths.
View less >
Conference Title
PROCEEDINGS OF THE 2017 IEEE 21ST INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE (EDOC 2017)
Volume
2017-January
Copyright Statement
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Subject
Computational logic and formal languages