Please use this identifier to cite or link to this item:
Type of publication: Straipsnis konferencijos medžiagoje kitose duomenų bazėse / Article in conference proceedings in other databases (P1c)
Field of Science: Informatika / Computer science (N009)
Author(s): Wan, Kaiyu;Kapoor, H. K;Das, Shirshendu;Raju, B;Man, Ka Lok;Krilavičius, Tomas
Title: Modelling and verification of compensating transactions using the Spin tool
Is part of: Engineers and computer scientists: 2012 IMECS : proceedings of the international Multiconference, 2012, 14-16 March, 2012, Hong Kong. Vol. 2. Hong Kong : Newswood Limited
Extent: p. 1163-1168
Date: 2012
Series/Report no.: (Lecture notes in engineering and computer science, 2078-0958)
Keywords: Long Running Transactions;Compensation Mechanisms;CSP;Promela;SPIN
ISBN: 9789881925190
Abstract: Complex transactions are part of the most commonly used systems. Substantial part of such transactions are business transactions. Usually, they coordinate complex interaction among multiple systems, so called Long Running Transactions (LRT). Well known roll-back mechanism does not suffice to handle faults in LRTs, therefore compensation mechanisms are introduced. However, introduced structures are rather complex and hard to be understood and handled. Formal methods are well known tool for modelling, analysis and synthesis of complex systems. In this paper we introduce a work in progress, a technique that allows modelling LRTs using Compensating CSP, then translating them to Promela language and analysing using SPIN tool. We exemplify it using Car Broker Service
Affiliation(s): Informatikos fakultetas
Taikomosios informatikos katedra
Vytauto Didžiojo universitetas
Appears in Collections:3. Konferencijų medžiaga / Conference materials
Universiteto mokslo publikacijos / University Research Publications

Files in This Item:
marc.xml8.05 kBXMLView/Open

MARC21 XML metadata

Show full item record

Page view(s)

checked on Nov 2, 2019


checked on Nov 2, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.