An approach for formal verification of business processes

Authors:
Armen Kostanyan;Vardan Matevosyan;Samvel Shoukourian;Anna Varosyan
Affiliations:
Yerevan State University, Yerevan, Armenia;Yerevan State University, Yerevan, Armenia;Yerevan State University, Yerevan, Armenia;Yerevan State University, Yerevan, Armenia
Venue:
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Year:
2009

Citing 6
Cited 0

Production workflow: concepts and techniques

Production workflow: concepts and techniques
Verification of workflow task structures: A petri-net-based approach

Information Systems
A program data flow analysis procedure

Communications of the ACM
An approach for system tests design and its application

VTS '95 Proceedings of the 13th IEEE VLSI Test Symposium
Evolving standards for IT service management

IBM Systems Journal
Introduction to Software Testing

Introduction to Software Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Business process (BP) verification has become an essential step in ensuring quality of designed BPs. The BP correctness can be checked by the process graph structural verification. Functional/behavioral verification of BPs is considered as another case of verification to verify the process semantic correctness. This can be done either formally or via process simulation. The most commonly used case of functional verification is a simulation of the process execution for all possible cases, but this can lead to exhaustion. That is the reason why the formal verification of processes should be applied whenever possible. This paper contains an extension of the acyclic BP verification algorithm for the general case, i.e. a new algorithm is suggested for verification of BPs that contain cycles. The solution is based on the notion of reducing verification of a given cyclic BP to verification of some acyclic one. Results obtained from applying the algorithm to some BPs from the IT Infrastructure Library (ITIL) are brought forward for consideration.