Browse by author
Lookup NU author(s): Dr Ellis SolaimanORCiD,
Dr Carlos Molina-Jimenez,
Emeritus Professor Santosh Shrivastava
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Converting a conventional contract into an electronic equivalent is not trivial. The difficulties are caused by the ambiguities that the original human-oriented text is likely to contain. In order to detect and remove these ambiguities the contract needs to be described in a mathematically precise notation before the description can be subjected to rigorous analysis. This paper identifies and discusses a list of correctness requirements that a typical executable business contract should satisfy. Next the paper shows how relevant parts of standard conventional contracts can be described by means of Finite State Machines (FSMs). Such a description can then be subjected to model checking. The paper demonstrates this using Promela language and the Spin validator.
Author(s): Solaiman E, Molina-Jimenez C, Shrivastava S
Editor(s): ME Orlowska
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Service-Oriented Computing - ICSOC 2003
Year of Conference: 2003
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science