G. Denker. Transactions in Object-Oriented Specifications. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Types Specification, Proc. 10th Workshop on Specification of Abstract Data Types joint with the 5th COMPASS Workshop , S.Margherita, Italy, May/June  Home/Search   Document Details and Download   Summary   Related Articles   Check

....an encapsulation. Transactions have been introduced in TROLL a temporal logic has been proposed that incorporates the concept of transactions to formalize such specifications, and an appropriate interpretation of specifications that incorporate transactions based on event structures has been given [270, 268, 271, 269]. Recently, refinement notions and results in the theory of process algebra were investigated and applied to the object oriented framework [510] Another approach to refinement based on non sequential automata is given in [666] Reasoning about object oriented systems. Object oriented technology ....

G. Denker. Transactions in Object--Oriented Specifications. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specifications. 10th Workshop on Specification of Abstract Data Types, pages 203--218. Springer LNCS 906, 1995. \Phi.

....family E = fE i g i2I of sequential event structures where E i = Ev i ; i ) The set family of proper events is denoted by Ev = fEv i g i2Id , and Ev = S Ev . That is, Sigma I event structures are locally sequential. This model is similar to the n agent model described in [LMRT91] Definition 10. Given a Sigma I event structure E, a distributed life cycle L = Lc; in E is an event structure L E that is the union of a family L = fL i g i2Id E of life cycles in E, i.e. L i E i for every i 2 Id. A distributed life cycle is a system of life cycles for the individual objects, ....

.... rules for omitting brackets, and we introduce further connectives through abbreviations, e.g. 0 ) for ( 0 ) The same applies to temporal operators, e.g. X i ) for ( X i ( G i ) for ( F i ( Y i ) for ( Y i ( and (H i ) for ( P i ( Definition 20. An object specification is a pair Ospec = Sigma ; Phi) where Sigma is an extended data signature, and Phi L Sigma (X) is a set of local formulae as axioms. Example 3. We specify a class of flip flops, based on the signature given in example 2. sorts nat, FF i id, FF a ac ops ....

[Article contains additional citation context not shown here]

G. Denker. Transactions in Object-Oriented Specifications. This volume

....structure of the system, i.e. its evolution, is reflected via a temporal logic which is interpreted in terms of event structures. For an exhaustive description of the underlying theory, semantics, and logics see [Ehr96, ES95, EH96] for the refinement of object specifications refer to [Den96, Den95] 3 Problem Domain In this section, we provide a short introduction to the application domain. We offer basic information about electrical apparatus in flameproof enclosures and the explosion test environment needed to certify them. The Physical Technical Federal Board (PTB) RBH87] is a federal ....

G. Denker. Transactions in object-oriented specifications. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification, 10th Workshop on Specification of Abstract Data Types, Joint with the 5th COMPASS Workshop; S. Margherita, Italy, number 906 in LNCS, pages 203-- 218. Springer-Verlag, Berlin, May 1995.

No context found.

G. Denker. Transactions in Object-Oriented Specifications. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Types Specification, Proc. 10th Workshop on Specification of Abstract Data Types joint with the 5th COMPASS Workshop , S.Margherita, Italy, May/June

....for any abstract concurrent system run. This is a first step towards bridging the gap between refinement of object oriented specifications and database theory. Work in the direction of integrating database aspects into a refinement theory for object oriented specification has already been done in [8, 9, 10]. In the first paper a syntax and semantics of transaction specification are presented and a syntactic characterisation for refinement is given. We use the objectoriented specification language Troll [25] to illustrate our ideas. Topics of the second paper are interleaving of transactions and a ....

....are presented and a syntactic characterisation for refinement is given. We use the objectoriented specification language Troll [25] to illustrate our ideas. Topics of the second paper are interleaving of transactions and a semantic refinement criterion. The refinement criterion presented in [9] is purely based on the event structure semantics. Here we continue this work by focussing especially on the notion of schedules as known from database theory. A model for a system specification represents the possible behaviour of the system. We extract all correct sequential system runs ....

G. Denker. Transactions in Object-Oriented Specifications. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Types joint with the 5th COMPASS Workshop, S.Margherita, Italy, May/June

....There is a very sophisticated theory of transactions in database theory. Correctness criteria for transactions have been developed and practically converted into protocols. Work in the direction of transferring results from concurrency control theory to the object paradigm has been presented in [4]. A range of possible further research direction opens up since the results of the wide database area are still to be applied to the object oriented field. Particularly, ideas from multi level transactions might be of interest, since during the design process reification is applied in an iterative ....

....temporal logic, where each formula is evaluated on two specification levels. Thus, we get different models on each abstraction level and relate this models by morphisms [6] Nevertheless, there is only one kind of temporal operator and a fixed interpretation for each of them in event structures [4]. Another approach is to have one model for all abstraction levels, but different temporal operators on one abstraction level, i.e. we might have different nexts, etc. This approach has the advantage that the formulae directly reflects where different abstraction levels are considered. Work in ....

Denker, G.: Transactions in Object-Oriented Specifications. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Types Specification, Proc. 10th Workshop on Specification of Abstract Data Types joint with the 5th COMPASS Workshop, S.Margherita, Italy, May/June

....correctness: essential properties of the abstract system should still be present in the concrete system. Problems might for instance arise out of concurrent access of shared resources or out of loss of synchronisation. Therefore in both areas conditions on refinements have been developed ( DE95, Den95a] Huh95] which ensure correctness of each refinement step. For the comparison we focus on two languages: Troll [HSJ 94] as an object oriented specification language and systems of sequential agents [LRT92] being a variant of TCSP [BHR84] as a particular process algebra. Our investigation is ....

G. Denker. Transactions in Object-Oriented Specifications. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Types Specification, Proc. 10th Workshop on Specification of Abstract Data Types joint with the 5th COMPASS Workshop, S.Margherita, Italy, May/June

....GR93, LMWF94] and other text books may give a good overview) Serializability is the interleaved execution of transactions such that the resulting effect is the same as the one of a serial execution. Recovery is the possibility to reach consistent database state in case of errors. In [DE95, Den95a, Den95b] we investigate refinement in objectoriented specification against the background of concurrency control theory. Especially, we propose a loose sequential composition operator according to serializability. Transactions and business processes: Modelling of enterprises demands techniques ....

....when refinement of actions to transactions is correct. Especially, the set of axioms established by a specification has to be carefully investigated under refinement. Syntactical and semantical refinement functions exploit the notion of transactions. Work in this direction has been given in [DE95, Den95a] and is subject of the thesis [Den95b] There is a very sophisticated theory of transactions in database theory. Correctness criteria for transactions have been developed and practically converted into protocols. First steps towards a formalization of transactions in the sense of database theory ....

G. Denker. Transactions in Object-Oriented Specifications. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Types Specification, Proc. 10th Workshop on Specification of Abstract Data Types joint with the 5th COMPASS Workshop, S.Margherita, Italy, May/June

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC