Extensible Canonical Process Model Synthesis Applying Formal Interpretation

Abstract

Abstract. The current period of IT development is characterized by an explosive growth of diverse information representation languages. Applying integration and composition of heterogeneous information components it is required to develop the canonical information model serving for adequate expression of semantics of various information models used in the environment encompassing required heterogeneous components. Basic principles of the canonical model synthesis include fixing of its kernel, constructing the kernel extensions for each specific information model of the environment so that this extension together with the kernel could be refined by this information model, and forming the canonical model as a union of all such extensions. Previously these principles have been successfully applied to the synthesis of structural and object canonical models. This paper 1 applies this technique to synthesis of the process canonical model. The method proposed is based on interpretation of process model semantics in logics, and specifically, in the Abstract Machine Notation that made possible to construct provable refinements of process specifications. This method has been applied to the environment of process models defined by workflow patterns classified by W.M.P. van der Aalst. Thus the canonical process model synthesized possesses a property of completeness with respect to broad class of process models used in various Workflow Management Systems as well as the languages used for process composition of Web services.

Petri Nets to B-Language Transformation in Software Development

“…The construction of the INITIALISATION clause in (7) and the formula (8) ensure that the initial value of each sv i will be the same as m 0 (p i ). In op j the predicate PCond j , specified according to (9) and (10), is similar to the enabling condition (3) and GS Sub j , defined by (11), (12), is equivalent to the new marking computation formula (4) (both for t j ). The SELECT GS is used because it is not executable when its condition (PCond j here) is false.…”

“…In [11,12] a mapping of a subset of the SYNTESIS scripting language, which is similar to HLPN, is presented. The target specification is the Refinement component of B-Method.…”

“…In principle, the approach is close to ours: places are mapped to variables and transitions to operations. What differs is that variables in [11,12] are sets and structure of operations is more complicated as high-level PN have individualised tokens. The purpose of the mapping is an analysis of scripts in SYNTESIS by means of B-Method.…”

MEDIATION FRAMEWORK FOR ENTERPRISE INFORMATION SYSTEM INFRASTRUCTURES: - Application-driven Approach

“…Another existing methods (e.g., used in Clio project (Haas, 2005)) supporting generation of mappings (queries) between source and target schemas are applicable to limited class of structured data models and do not allow to create an application specifications providing for registration of various kinds of relevant sources (including objects, services, processes). On the contrary, our canonical data model synthesis method provides a seminal role for synthesis of canonical models for various kinds of source information models including process models (Kalinichenko, 2005), service models (Stupnikov, 2006), ontological models .…”

“…Canonical model synthesis method we applied recently to the process models, required for describing application activities of enterprises (Kalinichenko, 2005). While mapping processes for synthesis of their canonical model, it is required to preserve the semantics of concurrency.…”