Feasibility of object real-time transactions.

Generally, we can identify two types of industrial and military real-time systems. The first have hard deadlines that have to be met, otherwise a catastrophe can occur. The second - non hard systems which provide service in real-time but what is important, a catastrophe will not occur. We know that, the control of a modem aircraft combat we can regard as a typical example of the hard category, where as a digital computer system for mobile telephones is a typical example of the nonhard systems. By another words, time is very important for these two categories of systems. Imagine three working objects in times t(1), t(2) and t(3) according to next picture. [GRAPHICS] The sum of the times it takes for the objects to carry out their tasks must then be less or equal to the time associated with the sequence in the use case, Sigma (3)(i-1) t(i) less than or equal to t. We have to imply a realtime property to cooperation between two transactions. Using a progressive Information Technology for development of Software Modules for 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, which will be processed in the Design phase. Therefore, a testing of object complex transaction before their programming appears as very useful activity This article introduces a formal description of the Object Cooperation Logic. Therefore, there are defined three types of transaction feasibility. It enables to search the feasibility of certain strings of transactions and object collaborations. There are found two different systems of state logical equations and one system of time conditions. The first describes a path transaction feasibility, the second a path object cooperation feasibility and the third expresses real-time conditions for requirements.