Algorithm for formal verification of business process templates

Authors:
A. S. Varosyan
Affiliations:
Yerevan State University, Yerevan, Armenia
Venue:
Cybernetics and Systems Analysis
Year:
2011

Citing 6
Cited 0

Production workflow: concepts and techniques

Production workflow: concepts and techniques
Characterizations of Reducible Flow Graphs

Journal of the ACM (JACM)
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
Microsoft Solutions Framework (MSF): A Pocket Guide

Microsoft Solutions Framework (MSF): A Pocket Guide
Microsoft Solutions Framework Essentials (Pro-Developer (Paperback))

Microsoft Solutions Framework Essentials (Pro-Developer (Paperback))

Quantified Score

Hi-index	0.00

Visualization

Abstract

A formal definition of a business process template is presented that is based on an analysis of ITIL and MOF libraries. Definitions of an initialization precondition and an execution postcondition are introduced. The solvability of the formal verification problem for business process templates is shown under some given initialization precondition and execution postcondition. This research is planned to be continued with a view to (i) using a formal verification algorithm with other business process template libraries and (ii) examining other business process libraries to identify new classes of business processes.Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 62---76, March---April 2011.