Enterprise process consistency expressed by a formal description of transactions

• Main Authors: Milan Mišovič, Ivana Rábová
• Format: Article
• Language: English
• Published: Mendel University Press 2005-01-01
• Series: Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis
• Subjects: object Cooperation logic; elementary transaction feasibility; state logical equations; elementary object cooperation feasibility; path; path transaction feasibility
• Online Access: https://acta.mendelu.cz/53/3/0117/

Using a progressive Information Technology for development of Software Modules for Enterprise Information Systems brings a lot of practical and theoretical problems. One of them is a verification of results achieved in Life Cycle Stages. Object Oriented Analysis has the main position in the Object Life Cycle of Information Systems. It gives fundamental diagrams that will be processed in the Design and Implementation phases. We mention diagrams for enterprise processes and their refining to enterprise transaction diagrams. The Unified Modeling Language (UML) has been very often used to enterprise processes and transactions modeling. There is one of very practical and theoretical problems concerning enterprise processes – their internal consistency that can be observed on the level of object transactions. We have in mind such problem as transaction feasibility and object cooperation feasibility in transactions that are strongly bound with states of objects. Therefore, a testing of object complex transactions before their programming appears to be very useful activity.This article introduces a formal description of the object cooperation logic. Therefore there is defined not only an elementary transaction feasibility but also an elementary object cooperation feasibility. It enables to search the feasibility of certain strings of elementary transactions and elementary object collaborations. One string of elementary transactions is very often regarded as a path. There are found two different systems of state logical equations. The first describes path transaction feasibility and the se- cond path object cooperation feasibility. The functional correctness of any complex transaction is founded on a functional correctness of all its paths.