A coloured Petri net analysis of the Transaction Internet Protocol. (28th January 2011)

• Record Type: Journal Article
• Authors: Georgiadis, Christos K.; Pimenidis, Elias; Kokkinidis, Ioannis
• Is Part Of: International journal of electronic security and digital forensics. Volume 3:Number 3(2010)
• Page Start: 204
• Page End: 222
• Publication Date: 2011-01-28
• Subjects: e-commerce transactions -- CP-nets -- coloured Petri nets -- model checking -- simulation -- Transaction Internet Protocol -- TIP -- electronic commerce -- holiday booking -- hotel reservations -- flight reservations -- holiday packages -- modelling; Computer crimes -- Periodicals; Computer crimes -- Investigation -- Periodicals; Computer security -- Periodicals; Electronic commerce -- Law and legislation -- Periodicals; Information warfare -- Periodicals; 005.805
• Languages: English
• ISSNs: 1751-911X

Abstract

The Transaction Internet Protocol (TIP) aims at facilitating e-commerce by enforcing atomicity guarantees in transactions distributed between several autonomous transaction processing systems. In this work, the authors explore a holiday booking scenario in which a customer is protected by the TIP such as to prevent ending up with a hotel reservation without the requested flight reservation i.e. enclosed in the same holiday package. In fact, TIP defines an approach that makes the commit processing independent of the communication protocol used, but there are a number of potential pitfalls that make it useful to provide a formal approach to reason about the behavioural properties of TIP. The authors propose a coloured Petri net model that allows interactive simulation and verification of correctness properties within the CPN-tools modelling environment. Representative results for the generated reachability graph, providing an insight into the model's structural properties are shown at the end of this paper. The model can be used in the CPN-tools environment for model checking tasks, where the properties of interest can be expressed in graph exploration or temporal logic-based state space queries.